Signal transmission method and apparatus

ABSTRACT

Embodiments of the present invention disclose a signal transmission method, a system, and a device. When measuring a reference signal and determining channel quality, UE obtains a difference between codeword to CSI-RS mapping relationships by using a channel quality measurement model, may calculate an optimized mapping relationship by means of measurement, and determines at least one mapping relationship from these mapping relationships, to adjust a codeword to CSI-RS mapping relationship of a channel, thereby improving system flexibility and increasing channel resource utilization.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of International Application No.PCT/CN2015/081715, filed on Jun. 17, 2015, which claims priority toInternational Application PCT/CN2014/080028, filed on Jun. 17, 2014. Thedisclosures of the aforementioned applications are hereby incorporatedby reference in their entireties.

TECHNICAL FIELD

Embodiments of the present invention relate to the communications field,and in particular, to a 3D-MIMO signal transmission technology.

BACKGROUND

A multiple-input multiple-output (Multiple Input Multiple Output, MIMO)technology has been widely applied in a wireless communications systemto improve a system capacity and ensure cell coverage. For example,multi-antenna based transmit diversity, open-loop/closed-loop spatialmultiplexing, and demodulation reference signal (Demodulation ReferenceSignal, DM-RS) based multi-stream transmission are used in downlink in aLong Term Evolution (Long Term Evolution, LTE) system. The DM-RS basedmulti-stream transmission is a main transmission mode used in an LTEAdvanced (LTE-A) system and a follow-up system.

In a conventional MIMO system, a codeword-to-pilot-port mappingrelationship of data is fixed when a quantity of transmission layers,that is, a rank is fixed. In this process, multiple mappingrelationships exist, and are mainly a codeword-to-layer mapping(Codeword-to-layer mapping) and a layer-to-pilot-port mapping. A pilotport includes a channel state information-reference signal (CSI-RS) portand a demodulation reference signal (DM-RS) port. A mapping relationshipbetween a layer and a corresponding CSI-RS port may be furtherclassified into a mapping relationship between the layer and acorresponding demodulation reference signal (DM-RS) port and a mappingrelationship between the corresponding DM-RS port and the correspondingCSI-RS port. When the quantity of transmission layers is fixed, thefixed mapping relationship causes a waste of resources and lowtransmission efficiency.

Each antenna port for transmitting a reference signal is mapped to fourantenna elements or four radio frequency units. The antenna port fortransmitting a reference signal refers to a logical port used fortransmission. Different weighted values are used to weight differentantenna elements or different transceiver radio units (TxRU, transceiverradio unit) to obtain beams in different directions. The weighted valuesare complex numbers. Weighting performed on an antenna element or a TxRUcorresponding to an antenna port for transmitting a reference signal maybe a mapping relationship. FIG. 8a shows a case in which two antennaports for transmitting a reference signal are mapped to four antennaelements. In the present invention, a port 0 (802) and a port 4 (803)are mapped to four antenna elements in the first column (801) in a firstantenna array; a port 1 (805) and a port 5 (806) are mapped to fourantenna elements in the second column (804) in the first antenna array;a port 2 (808) and a port 6 (809) are mapped to four antenna elements inthe third column (807) in the first antenna array; and a port 3 (811)and a port 7 (812) are mapped to four antenna elements in the fourthcolumn (810) in the first antenna array. The port 0 to the port 7 areantenna ports for transmitting a reference signal. The four antennaelements in the first column in the first antenna array are used as anexample. Beams formed by using the four antenna elements in the firstcolumn in the first antenna array are formed by mapping the port 0 andthe port 4 to the four antenna elements and by means of transmission.This specific mapping manner may be in a form of weighting. Weightedvalues that may be used for the port 0 are w0, w1, w2, and w3, andweighted values used for the port 4 that is mapped to the same fourantenna elements (or TxRUs) are w4, w5, w6, and w7, where w0, w1, w2,w3, w4, w5, w6, and w7 are complex numbers. Therefore, a direction of abeam, formed by performing weighting by using w0, w1, w2, and w3, of theport 0 is a first direction (813), and a direction of a beam, formed byperforming weighting by using w4, w5, w6, and w7, of the port 4 is asecond direction (814). Specific beam orientations of the firstdirection and the second direction may be determined according to ascenario. For example, the first direction may point upwards relative toa horizontal plane, and the second direction may point downwardsrelative to the horizontal plane; or the first direction and the seconddirection may point to determined directions separately.

FIG. 8b is a schematic diagram of mapping antenna ports for transmittinga reference signal to two antenna elements. A port 4 (824) is mapped totwo antenna elements 841 and 842 in the first column in a first antennaarray. A Port 0 (823) is mapped to the other two antenna elements in thefirst column in the first antenna array. A mapping relationship ofanother column is similar. For the port 4, the antenna elements 841 and842 corresponding to the port 0 are weighted, and so on.

The weighting described above may be precoding weighting, that is, whenprecoding is being performed on a signal by using a precoding matrix,weighting is performed by using the precoding matrix, which isequivalent to weighting performed on the signal. Alternatively, theweighting may be performed on a driver network of a radio frequency byusing a circuit. Generally, if slashes shown in the figure indicateantenna elements, the weighting may be driver network weighting; if theslashes indicate TxRU radio units, the weighting manner may be precodingweighting. The precoding weighting may be baseband weighting.

SUMMARY

In view of this, embodiments of the present invention provide a datatransmission method, an apparatus, and a system, to implementhigh-efficient data transmission in 3D-MIMO. The technical solutions inthe present invention may be applied to various wireless communicationssystems, for example, a Global System for Mobile Communications (GlobalSystem for Mobile communications, GSM for short), a general packet radioservice (General Packet Radio Service, GPRS for short) system, a CodeDivision Multiple Access (Code Division Multiple Access, CDMA for short)system, a CDMA2000 system, a Wideband Code Division Multiple Access(Wideband Code Division Multiple Access, WCDMA for short) system, a LongTerm Evolution (Long Term Evolution, LTE for short) system, or aWorldwide Interoperability for Microwave Access (WorldwideInteroperability for Microwave Access, WiMAX for short) system.

A network device in the present invention may be a base station. Thebase station may be a base station controller (Base Station Controller,BSC for short) in the GSM system, the GPRS system, or the CDMA system,or may be an evolved NodeB (Evolved NodeB, eNB for short) in the LTEsystem, or may be a network element such as an access service networkbase station (Access Service Network Base Station, ASN BS for short) ina WiMAX network. UE may be a device such as a mobile phone or a tabletcomputer. The eNB and the UE are used as an example for description insome embodiments of the present invention. However, types of the basestation and a terminal apparatus are not limited.

According to a first aspect, the present invention provides a datatransmission method, including: receiving a first reference signal sentby a network device; measuring the first reference signal to obtain ameasurement result; determining at least one mapping relationship from amapping relationship set according to the measurement result, where themapping relationship set includes at least one of a first relationshipset, a second relationship set, or a third relationship set, the firstrelationship set includes multiple mapping relationships between acodeword and transmission layers when a quantity of transmission layersis determined, the second relationship set includes multiple mappingrelationships between the transmission layers and a demodulationreference signal DM-RS port, and the third relationship set includesmultiple mapping relationships between the transmission layers and achannel state information-reference signal CSI-RS port; and sending anotification message to the network device, where the notificationmessage is used to indicate the determined mapping relationship.

In a first possible implementation manner of the first aspect, themethod further includes: sending a channel quality indicator CQI to thenetwork device, where at least one of a quantity of the CQIs or a valueof the CQI is obtained according to the determined at least one mappingrelationship.

In a second possible implementation manner of the first aspect, when thequantity of transmission layers is greater than or equal to 2, the firstrelationship set includes at least a first mapping relationship and asecond mapping relationship; in the first mapping relationship, a firstcodeword is mapped to a first transmission layer set, and a secondcodeword is mapped to a second transmission layer set; in the secondmapping relationship, the first codeword is mapped to a thirdtransmission layer set, and the second codeword is mapped to a fourthtransmission layer set; where each transmission layer set includes atleast one transmission layer, the first transmission layer set isdifferent from the third transmission layer set, and the secondtransmission layer set is different from the fourth transmission layerset.

In a third possible implementation manner of the first aspect,

when the quantity of transmission layers is greater than or equal to 2,at least one first relationship in at least one mapping relationship inthe first relationship set meets a first condition, where the firstcondition is: in mapping relationships between k codewords andrespective layers, if the i^(th) codeword and the j^(th) codeword meeti>j, m<n is met, where each codeword is mapped to at least one layer, alayer with a minimum sequence number in the layer corresponding to thei^(th) codeword is the m^(th) layer, and a layer with a maximum sequencenumber in the layer corresponding to the j^(th) codeword is the n^(th)layer.

In a fourth possible implementation manner of the first aspect, thethird relationship is a mapping relationship between the DM-RS port andthe CSI-RS port.

In a fifth possible implementation manner of the first aspect, the firstreference signal is a CSI-RS signal.

In a sixth possible implementation manner of the first aspect, the firstreference signal includes at least two reference signals correspondingto different CSI-RS configuration information, and the reference signalscorresponding to the different CSI-RS configuration information arecorresponding to different ports.

In a seventh possible implementation manner of the first aspect, whenthe mapping relationship set includes the first relationship set, theperforming measurement according to the first reference signal, and thedetermining one mapping relationship from a mapping relationship setaccording to the measurement result include: measuring the firstreference signal to obtain a channel coefficient; calculating anequivalent channel coefficient of a channel according to the channelcoefficient and a codebook; calculating a signal-to-noise ratio of eachlayer according to the equivalent channel coefficient of the channel;calculating a channel capacity of each codeword-to-layer mappingrelationship in the first relationship set according to thesignal-to-noise ratio of each layer; and determining a codeword-to-layermapping relationship with a maximum channel capacity.

According to a second aspect, the present invention provides a datatransmission method, including: sending, by a network device, a firstreference signal to user equipment UE; receiving, by the network device,a notification message that is sent by the UE and that is generatedaccording to the first reference signal, where the notification messageis used to indicate at least one mapping relationship in a mappingrelationship set; and obtaining, by the network device, the at least onemapping relationship from the mapping relationship set according to themapping relationship message, where the at least one mappingrelationship is determined by the UE from the mapping relationship setaccording to the first reference signal, the mapping relationship setincludes at least one of a first relationship set, a second relationshipset, or a third relationship set, the first relationship set includesmultiple mapping relationships between a codeword and transmissionlayers when a quantity of transmission layers is determined, the secondrelationship set includes multiple mapping relationships between thetransmission layers and a demodulation reference signal DM-RS port, andthe third relationship set includes multiple mapping relationshipsbetween the transmission layers and a channel stateinformation-reference signal CSI-RS port.

In a first possible implementation manner of the second aspect, themethod further includes: receiving a channel quality indicator CQI sentby the UE, where at least one of a quantity of the CQIs or a value ofthe CQI is obtained according to the determined at least one mappingrelationship.

In a second possible implementation manner of the second aspect, whenthe quantity of transmission layers is greater than or equal to 2, thefirst relationship set includes at least a first mapping relationshipand a second mapping relationship; in the first mapping relationship, afirst codeword is mapped to a first transmission layer set, and a secondcodeword is mapped to a second transmission layer set; in the secondmapping relationship, the first codeword is mapped to a thirdtransmission layer set, and the second codeword is mapped to a fourthtransmission layer set; where each transmission layer set includes atleast one transmission layer, the first transmission layer is differentfrom the third transmission layer set, and the second transmission layerset is different from the fourth transmission layer set.

In a third possible implementation manner of the second aspect, when thequantity of transmission layers is greater than or equal to 2, at leastone first relationship in at least one mapping relationship in the firstrelationship set meets a first condition, where the first condition is:in mapping relationships between k codewords and respective layers, ifthe i^(th) codeword and the j^(th) codeword meet i>j, m<n is met, whereeach codeword is mapped to at least one layer, a layer with a minimumsequence number in the layer corresponding to the i^(th) codeword is them^(th) layer, and a layer with a maximum sequence number in the layercorresponding to the j^(th) codeword is the n^(th) layer.

In a fourth possible implementation manner of the second aspect, thethird relationship is a mapping relationship between the DM-RS port andthe CSI-RS port.

In a fifth possible implementation manner of the second aspect, thefirst reference signal is a CSI-RS signal.

In a sixth possible implementation manner of the second aspect, thefirst reference signal includes at least two reference signalscorresponding to different CSI-RS configuration information, and thereference signals corresponding to the different CSI-RS configurationinformation are corresponding to different ports.

According to a third aspect, the present invention provides userequipment, including: a receiving unit, configured to receive a firstreference signal sent by a network device; a measurement unit,configured to measure the first reference signal to obtain a measurementresult; a first determining unit, configured to determine at least onemapping relationship from a mapping relationship set according to themeasurement result, where the mapping relationship set includes at leastone of a first relationship set, a second relationship set, or a thirdrelationship set, the first relationship set includes multiple mappingrelationships between a codeword and transmission layers when a quantityof transmission layers is determined, the second relationship setincludes multiple mapping relationships between the transmission layersand a demodulation reference signal DM-RS port, and the thirdrelationship set includes multiple mapping relationships between thetransmission layers and a channel state information-reference signalCSI-RS port; and a first sending unit, configured to send a notificationmessage to the network device, where the notification message is used toindicate the mapping relationship determined by the first determiningunit.

In a first possible implementation manner of the third aspect, the userequipment further includes a second sending unit, configured to send achannel quality indicator CQI to the network device, where at least oneof a quantity of the CQIs or a value of the CQI is obtained according tothe determined at least one mapping relationship.

In a second possible implementation manner of the third aspect, when thequantity of transmission layers is greater than or equal to 2, the firstrelationship set includes at least a first mapping relationship and asecond mapping relationship; in the first mapping relationship, a firstcodeword is mapped to a first transmission layer set, and a secondcodeword is mapped to a second transmission layer set; in the secondmapping relationship, the first codeword is mapped to a thirdtransmission layer set, and the second codeword is mapped to a fourthtransmission layer set; where each transmission layer set includes atleast one transmission layer, the first transmission layer set isdifferent from the third transmission layer set, and the secondtransmission layer set is different from the fourth transmission layerset.

In a third possible implementation manner of the third aspect, when thequantity of transmission layers is greater than or equal to 2, at leastone first relationship in at least one mapping relationship in the firstrelationship set meets a first condition, where the first condition is:in mapping relationships between k codewords and respective layers, ifthe i^(th) codeword and the j^(th) codeword meet i>j, m<n is met, whereeach codeword is mapped to at least one layer, a layer with a minimumsequence number in the layer corresponding to the i^(th) codeword is them^(th) layer, and a layer with a maximum sequence number in the layercorresponding to the j^(th) codeword is the n^(th) layer.

In a fourth possible implementation manner of the third aspect, thethird relationship is a mapping relationship between the DM-RS port andthe CSI-RS port.

In a fifth possible implementation manner of the third aspect, the firstreference signal is a CSI-RS signal.

In a sixth possible implementation manner of the third aspect, the firstreference signal includes at least two reference signals correspondingto different CSI-RS configuration information, and the reference signalscorresponding to the different CSI-RS configuration information arecorresponding to different ports.

In a seventh possible implementation manner of the third aspect, thefirst determining unit includes: an obtaining unit, configured to obtaina channel coefficient according to the measurement result of the firstreference signal; a first calculation unit, configured to calculate anequivalent channel coefficient of a channel according to the channelcoefficient and a codebook; a second calculation unit, configured tocalculate a signal-to-noise ratio of each layer according to theequivalent channel coefficient of the channel; a third calculation unit,configured to calculate a channel capacity of each codeword-to-layermapping relationship in the first relationship set according to thesignal-to-noise ratio of each layer; and a second determining unit,configured to determine a codeword-to-layer mapping relationship with amaximum channel capacity.

According to a fourth aspect, the present invention provides a networkdevice, including: a sending unit, configured to send a first referencesignal to user equipment UE; a first receiving unit, configured toreceive a mapping relationship message that is sent by the UE and thatis generated according to the first reference signal, where thenotification message is used to indicate at least one mappingrelationship in a mapping relationship set; and a determining unit,configured to obtain the at least one mapping relationship from themapping relationship set according to the mapping relationship message,where the at least one mapping relationship is determined by the UE fromthe mapping relationship set according to the first reference signal,the mapping relationship set includes at least one of a firstrelationship set, a second relationship set, or a third relationshipset, the first relationship set includes multiple mapping relationshipsbetween a codeword and transmission layers when a quantity oftransmission layers is determined, the second relationship set includesmultiple mapping relationships between the transmission layers and ademodulation reference signal DM-RS port, and the third relationship setincludes multiple mapping relationships between the transmission layersand a channel state information-reference signal CSI-RS port.

In a first possible implementation manner of the fourth aspect, thenetwork device further includes a second receiving unit, configured toreceive a channel quality indicator CQI sent by the UE, where at leastone of a quantity of the CQIs or a value of the CQI is obtainedaccording to the determined at least one mapping relationship.

In a second possible implementation manner of the fourth aspect, whenthe quantity of transmission layers is greater than or equal to 2, thefirst relationship set includes at least a first mapping relationshipand a second mapping relationship; in the first mapping relationship, afirst codeword is mapped to a first transmission layer set, and a secondcodeword is mapped to a second transmission layer set; in the secondmapping relationship, the first codeword is mapped to a thirdtransmission layer set, and the second codeword is mapped to a fourthtransmission layer set; where each transmission layer set includes atleast one transmission layer, the first transmission layer is differentfrom the third transmission layer set, and the second transmission layerset is different from the fourth transmission layer set.

In a third possible implementation manner of the fourth aspect, when thequantity of transmission layers is greater than or equal to 2, at leastone first relationship in at least one mapping relationship in the firstrelationship set meets a first condition, where the first condition is:in mapping relationships between k codewords and respective layers, ifthe i^(th) codeword and the j^(th) codeword meet i>j, m<n is met, whereeach codeword is mapped to at least one layer, a layer with a minimumsequence number in the layer corresponding to the i^(th) codeword is them^(th) layer, and a layer with a maximum sequence number in the layercorresponding to the j^(th) codeword is the n^(th) layer.

In a fourth possible implementation manner of the fourth aspect, thethird relationship is a mapping relationship between the DM-RS port andthe CSI-RS port.

In a fifth possible implementation manner of the fourth aspect, thefirst reference signal is a CSI-RS signal.

In a sixth possible implementation manner of the fourth aspect, thefirst reference signal includes at least two reference signalscorresponding to different CSI-RS configuration information, and thereference signals corresponding to the different CSI-RS configurationinformation are corresponding to different ports.

According to the foregoing solutions, in the methods, apparatuses, andembodiments provided in the present invention, a codeword-to-portmapping relationship can be configured flexibly, thereby achievingpurposes of improving channel quality and increasing a signal-to-noiseratio.

BRIEF DESCRIPTION OF DRAWINGS

FIG. 1 is a flowchart of an embodiment of a data transmission methodaccording to the present invention;

FIG. 2 is a flowchart of another embodiment of a data transmissionmethod according to the present invention;

FIG. 3 is a schematic structural diagram of an embodiment of userequipment according to the present invention;

FIG. 4 is a schematic structural diagram of an embodiment of anotheruser equipment according to the present invention;

FIG. 5 is a schematic structural diagram of an embodiment of a networkdevice according to the present invention;

FIG. 6 shows a schematic diagram of a computer system implementing datatransmission according to the present invention;

FIG. 7 shows a schematic systematic diagram of implementing datatransmission according to the present invention;

FIG. 8a is a schematic diagram of mapping antenna ports for transmittinga reference signal to four antenna elements; and

FIG. 8b is a schematic diagram of mapping antenna ports for transmittinga reference signal to two antenna elements.

DESCRIPTION OF EMBODIMENTS

In the embodiments of the present invention, apparatus embodiments forimplementing steps and methods in the foregoing method embodiments arefurther provided. It should be understood that the steps in the methodand system embodiments of the present invention are merely animplementation solution, and the present invention sets no limitation tobut requires protection of logical integration, splitting, and sequenceadjustment to the steps of various solutions; the apparatuses, modules,units, and entities in the apparatus embodiments of the presentinvention are merely an implementation solution, and the presentinvention sets no limitation to but requires protection of splitting,combination, or another logical modification to various apparatuses,modules, units, and entities.

FIG. 1 shows an embodiment of a data transmission method in the presentinvention. The method is a method in which user equipment UE transmitsdata. The method may be applied to a network including the userequipment. The UE selects at least one mapping relationship set from atleast one mapping relationship set, then selects a specific mappingrelationship from the selected mapping relationship set, and transmitsdata according to the mapping relationship. Details are as follows:

Step 101: Receive a first reference signal sent by a network device.Optionally, the network device is an evolved NodeB eNB.

Step 102: Measure the first reference signal to obtain a measurementresult.

Step 103: Determine at least one mapping relationship from a mappingrelationship set according to the measurement result, where the mappingrelationship set includes at least one of a first relationship set, asecond relationship set, or a third relationship set, the firstrelationship set includes multiple mapping relationships between acodeword and transmission layers when a quantity of transmission layersis determined, the second relationship set includes multiple mappingrelationships between the transmission layers and a demodulationreference signal DM-RS port, and the third relationship set includesmultiple mapping relationships between the transmission layers and achannel state information-reference signal CSI-RS port. The DM-RS portmay be a corresponding port for transmitting a demodulation referencesignal DM-RS, and the CSI-RS port may be a corresponding port fortransmitting a channel state information-reference signal CSI-RS.

It should be understood that the mapping relationship set may includerespective mapping relationships in multiple sets of the firstrelationship set, the second relationship set, and the thirdrelationship set. For example, the mapping relationship set may includea mapping relationship of mapping a codeword to a layer of the codewordin the first relationship set, and further includes a mappingrelationship between a layer and a corresponding CSI-RS port in thethird relationship set. The UE determines a mapping relationship betweena codeword and a layer of the codeword from the first relationship set,and the UE further determines a mapping relationship between a layer anda corresponding CSI-RS port from the third relationship set. Adetermining sequence of the first relationship set, the secondrelationship set, and the third relationship set is not limited in thepresent invention. In addition, there are many manners for determining amapping relationship from the mapping relationship set. In an embodimentof the present invention, when the mapping relationship set includes thefirst relationship set, step 102 and step 103 may be:

receiving the first reference signal sent by the network device;measuring the first reference signal to obtain a channel coefficient;calculating an equivalent channel coefficient of a channel according tothe channel coefficient and a codebook; calculating a signal-to-noiseratio of each layer according to the equivalent channel coefficient ofthe channel; calculating a channel capacity of each codeword-to-layermapping relationship in the first relationship set according to thesignal-to-noise ratio of each layer; and determining a codeword-to-layermapping relationship with a maximum channel capacity. Specifically, thefirst reference signal is a CSI-RS signal. The UE measures the CSI-RS toobtain a transmission matrix of the channel. Optionally, the firstreference signal is a reference signal corresponding to configurationinformation of at least two CSI-RSs. The first reference signalcorresponding to different CSI-RS configuration information iscorresponding to different ports. For example, when a quantity of allconfigured CSI-RS ports is 8 and a quantity of transmission layers is 5,a first CSI-RS signal is corresponding to a port 0 to a port 3, and asecond CSI-RS signal is corresponding to a port 4 to a port 7; andcorrespondingly, a CSI-RS of first configuration information iscorresponding to the port 0 to the port 3, and a CSI-RS of secondconfiguration information is corresponding to the port 4 to the port 7.A CSI-RS port index of the second configuration information may benumbered still from a port 0. For ease of distinguishing, the CSI-RSport index of the second configuration information is numbered from aport 4 herein.

In an embodiment, at least two reference signals included in the firstreference signal that are corresponding to different CSI-RSconfiguration information are reference signals obtained by means ofprecoding weighting. Optionally, at least two reference signals includedin the first reference signal that are corresponding to different CSI-RSconfiguration information are reference signals obtained by means ofdifferent precoding weighting.

In an embodiment, the CSI-RS configuration information includes alocation of a time-frequency resource occupied by a CSI-RS. As shown inTable 1, different frame structures may be configured according todifferent CSI-RSs. Alternatively, the CSI-RS configuration informationincludes a CSI-RS subframe configuration, for example, a CSI-RS sendingperiod and a time offset (offset) in Table 2.

TABLE 1 CSI-RS configuration in the case of a cyclic prefix CSI-RSconfiguration indication CSI-RS 1 or 2 4 8 configuration (k′, l′) n_(s)mod 2 (k′, l′) n_(s) mod 2 (k′, l′) n_(s) mod 2 Frame 0 (9, 5) 0 (9, 5)0 (9, 5) 0 structure 1/2 1 (11, 2)  1 (11, 2)  1 (11, 2)  1 2 (9, 2) 1(9, 2) 1 (9, 2) 1 3 (7, 2) 1 (7, 2) 1 (7, 2) 1 4 (9, 5) 1 (9, 5) 1 (9,5) 1 5 (8, 5) 0 (8, 5) 0 6 (10, 2)  1 (10, 2)  1 7 (8, 2) 1 (8, 2) 1 8(6, 2) 1 (6, 2) 1 9 (8, 5) 1 (8, 5) 1 10 (3, 5) 0 11 (2, 5) 0 12 (5, 2)1 13 (4, 2) 1 14 (3, 2) 1 15 (2, 2) 1 16 (1, 2) 1 17 (0, 2) 1 18 (3, 5)1 19 (2, 5) 1 Only a frame 20 (11, 1)  1 (11, 1)  1 (11, 1)  1 structure2 exists 21 (9, 1) 1 (9, 1) 1 (9, 1) 1 22 (7, 1) 1 (7, 1) 1 (7, 1) 1 23(10, 1)  1 (10, 1)  1 24 (8, 1) 1 (8, 1) 1 25 (6, 1) 1 (6, 1) 1 26(5, 1) 1 27 (4, 1) 1 28 (3, 1) 1 29 (2, 1) 1 30 (1, 1) 1 31 (0, 1) 1

TABLE 2 CSI-RS subframe configuration CSI-RS subframe offset CSI-RSsubframe CSI-RS period T_(CSI-RS) Δ_(CSI-RS) configuration I_(CSI-RS)(unit: subframe) (unit: subframe) 0-4 5 I_(CSI-RS)  5-14 10 I_(CSI-RS)-515-34 20 I_(CSI-RS)-15 35-74 40 I_(CSI-RS)-35  75-154 80 I_(CSI-RS)-75

CSI-RS port sets of different configuration information have differentprecoding weighted values. That is, a quantity of CSI-RS ports of thefirst configuration information is 4: the port 0 to the port 3; aquantity of CSI-RS ports of the second configuration information is 4:port4˜port7; and the port 0 to the port 3 and the port 4 to the port 7have different precoding weighting.

In an embodiment, quantities of CSI-RS ports of different configurationinformation may be different.

Specifically, the UE measures a CSI-RS to obtain a channel matrix.

In an embodiment, the UE determines a quantity of layers and determinesmapping relationships between the layers and different correspondingCSI-RS ports.

The UE obtains a channel matrix by measuring the first CSI-RS:

$H_{1} = \begin{bmatrix}h_{00} & h_{01} & L & h_{03} \\h_{10} & h_{11} & L & h_{13} \\M & M & L & M \\h_{70} & h_{71} & L & h_{73}\end{bmatrix}$

The UE obtains a channel matrix by measuring the second CSI-RS:

$H_{2} = \begin{bmatrix}h_{04} & h_{05} & L & h_{07} \\h_{14} & h_{15} & L & h_{17} \\M & M & L & M \\h_{74} & h_{75} & L & h_{77}\end{bmatrix}$

A finally combined channel matrix is:

$H = \begin{bmatrix}h_{00} & h_{01} & L & h_{03} \\h_{10} & h_{11} & L & h_{17} \\M & M & L & M \\h_{70} & h_{71} & L & h_{77}\end{bmatrix}$

If the determined codebook is W_(8×5), the equivalent channelcoefficient (a matrix) is H_(eff)=HW_(8×5), and

${H_{eff} = {\begin{bmatrix}h_{00}^{eff} & h_{01}^{eff} & L & h_{03}^{eff} \\h_{10}^{eff} & h_{11}^{eff} & L & h_{14}^{eff} \\M & M & L & M \\h_{70}^{eff} & h_{71}^{eff} & L & h_{74}^{eff}\end{bmatrix} = \left\lbrack {{{\hat{h}}_{eff}(0)}\mspace{14mu} {{\hat{h}}_{eff}(1)}\mspace{14mu} {{\hat{h}}_{eff}(2)}\mspace{14mu} {{\hat{h}}_{eff}(3)}\mspace{14mu} {{\hat{h}}_{eff}(4)}} \right\rbrack}},$

where ĥ_(eff)(x) indicates an equivalent channel coefficient of thex^(th) layer. It should be understood that, for convenience, a form of amatrix is used for description in the present invention. Variouscalculation processes or methods in the present invention may beimplemented in other forms, which may be but are not limited to sequencecalculation or array calculation.

A signal-to-noise ratio of a corresponding layer is calculated by usingan equivalent channel coefficient ĥ_(eff)(x) of the layer. Optionally,an MMSE algorithm may be used for the calculation.

The channel capacity of each codeword-to-layer mapping relationship inthe first relationship set is calculated according to thesignal-to-noise ratio of each layer. Optionally, a capacity formula maybe used for the calculation. For example, a mapping relationship in thefirst relationship set is:

x ⁽³⁾(i)=d ⁽⁰⁾(2i)

x ⁽⁴⁾(i)=d ⁽⁰⁾(2i+1)

x ⁽⁰⁾(i)=d ⁽¹⁾(3i)

x ⁽¹⁾(i)=d ⁽¹⁾(3i+1)

x ⁽²⁾(i)=d ⁽¹⁾(3i+2)

A corresponding codeword 0 is mapped to the third and fourth layers, anda signal-to-noise ratio of the corresponding codeword 0 is SNR_CW(0). Acorresponding codeword 1 is mapped to the 0^(th), first, and secondlayers, and a signal-to-noise ratio of the corresponding codeword 1 isSNR_CW(1). A total capacity C that is of the mapping relationships andthat is obtained by using the capacity formula is:

C=101g(1+SNR_CW(0))(1+SNR_CW(1))

According to the method, each codeword-to-layer mapping relationship inthe first relationship set is calculated in a traversal manner, and thecodeword-to-layer mapping relationship corresponding to the maximumcapacity is selected.

It should be understood that determining the codeword-to-layer mappingrelationship from the first relationship set is merely an example. Inthis process, different implementation manners may exist. For example,the mapping relationship is determined by measuring a throughput and bymeasuring a channel capacity and another parameter, or determinedcomprehensively by using multiple parameters. The present invention setsno limitation to but requires protection of all methods that meetselection of a mapping relationship from the first relationship set.

In an embodiment, when the quantity of transmission layers is greaterthan or equal to 2,

the first relationship set includes at least a first mappingrelationship and a second mapping relationship; in the first mappingrelationship, a first codeword is mapped to a first transmission layerset, and a second codeword is mapped to a second transmission layer set;in the second mapping relationship, the first codeword is mapped to athird transmission layer set, and the second codeword is mapped to afourth transmission layer set.

Each transmission layer set includes at least one transmission layer,the first transmission layer set is different from the thirdtransmission layer set, and the second transmission layer set isdifferent from the fourth transmission layer set. It should beunderstood that differences between the sets may mean that an elementincluded in the first transmission layer set is different from anelement included in the third transmission layer set, and an elementincluded in the second transmission layer set is different from anelement included in the fourth transmission layer set. If there is noexplanation, differences between sets involved in the present inventionmay be understood as the foregoing concept, and are not described again.

In an embodiment, when the quantity of transmission layers is greaterthan or equal to 2, at least one first relationship in at least onemapping relationship in the first relationship set meets a firstcondition, where the first condition is:

in mapping relationships between k codewords and respective layers, ifthe i^(th) codeword and the j^(th) codeword meet i>j, m<n is met, wherea layer with a minimum sequence number in the layer corresponding to thei^(th) codeword is the m^(th) layer, and a layer with a maximum sequencenumber in the layer corresponding to the j^(th) codeword is the n^(th)layer. For example, the following first relationship mapping exists:

x ⁽⁰⁾(i)=d ⁽⁰⁾(3i)

x ⁽²⁾(i)=d ⁽⁰⁾(3i+1)

x ⁽⁴⁾(i)=d ⁽⁰⁾(3i+2)

x ⁽¹⁾(i)=d ⁽¹⁾(2i)

x ⁽³⁾(i)=d ⁽¹⁾(2i+1)

where d^((k))(q) indicates the q^(th) value of the k^(th) codeword,x^((m))(n)=d^((k))(q) indicates that the q^(th) value of the k^(th)codeword is mapped to the m^(th) layer, and p is a quantity of layers.

A quantity of codewords is k=2, that is, there are two codewords: the0^(th) codeword and the first codeword 1. In this example, i=1, and j=0.The layer with the minimum sequence number in the layer corresponding tothe i^(th) codeword is the m^(th) layer, that is, a minimum sequencenumber value m of a layer corresponding to the codeword 1 is 1; thelayer with the maximum sequence number in the layer corresponding to thej^(th) codeword is the n^(th) layer, that is, a maximum sequence numbervalue n of a layer corresponding to the codeword 0 is 4, where m<n ismet.

In an embodiment, when the quantity of transmission layers is greaterthan or equal to 2, the first relationship set includes at least twofirst relationships. When a rank value (the quantity of transmissionlayers) is determined, the two first relationships are firstrelationships of mapping different quantities of codewords to a samequantity of transmission layers. For example, when the rank value is 5,the first relationship set may include a case in which one codeword ismapped to five layers and a case in which two codewords are mapped tofive layers. Specifically, the following two first relationships arerespectively corresponding to the case in which two codewords are mappedto five layers and the case in which one codeword is mapped to fivelayers:

x ⁽⁰⁾(i)=d ⁽⁰⁾(3i)x ⁽⁰⁾(i)=d ⁽⁰⁾(5i)

x ⁽¹⁾(i)=d ⁽⁰⁾(3i+1)x ⁽¹⁾=(i)d ⁽⁰⁾(5i+1)

x ⁽²⁾(i)=d ⁽⁰⁾(3i+2)x ⁽²⁾(i)=d ⁽⁰⁾(5i+2)

x ⁽³⁾(i)=d ⁽¹⁾(2i)x ⁽³⁾(i)=d ⁽⁰⁾(5i+3)

x ⁽⁴⁾(i)=d ⁽¹⁾(2i+1) and x ⁽⁴⁾(i)=)d ⁽⁰⁾(5i+4)

In addition, the base station may notify, by using dynamic signaling orhigher layer signaling, the UE of a first relationship in the firstrelationship set, or a second relationship in the second relationshipset, or a third relationship in the third relationship set that is usedduring scheduling this time to demodulate data.

Next, the present invention provides a first relationship setembodiment, and some possible first relationship sets are provided inthis embodiment. The first relationship set includes at least two of thefollowing mapping relationships of mapping codewords to respectivetransmission layers, and in this embodiment, a rank indication value maybe a RANK value:

x ⁽¹⁾(i)=d ⁽⁰⁾(i)x ⁽⁰⁾(i)=d ⁽⁰⁾(i)x ⁽⁰⁾(i)=d ⁽⁰⁾(2i)

x ⁽⁰⁾(i)=d ⁽¹⁾(i),x ⁽¹⁾(i)=d ⁽⁰⁾(i), and x ⁽¹⁾(i)=d ⁽⁰⁾(2i+1),

where the rank indication value is 2, d^((k))(q) indicates the q^(th)value of the k^(th) codeword, x^((p))(n)=d^((k))(q) indicates that theq^(th) value of the k^(th) codeword is mapped to the m^(th) layer, and pis a quantity of layers.

Alternatively,

the first relationship set includes at least two of the followingmapping relationships of mapping codewords to respective layers:

x ⁽⁰⁾(i)=d ⁽⁰⁾(i)x ⁽¹⁾(i)=d ⁽⁰⁾(i)x ⁽²⁾(i)=d ⁽⁰⁾(i)

x ⁽¹⁾(i)=d ⁽¹⁾(2i)x ⁽⁰⁾(i)=d ⁽¹⁾(2i)x ⁽⁰⁾(i)=d ⁽¹⁾(2i)

x ⁽²⁾(i)=d ⁽¹⁾(2i+1),x ⁽²⁾(i)=d ⁽¹⁾(2i+1),x ⁽¹⁾(i)=d ⁽¹⁾(2i+1)

x ⁽⁰⁾(i)=d ⁽⁰⁾(2i)x ⁽¹⁾(i)=d ⁽⁰⁾(2i)x ⁽²⁾(i)=d ⁽⁰⁾(2i)x ⁽⁰⁾(i)=d ⁽⁰⁾(3i)

x ⁽¹⁾(i)=d ⁽⁰⁾(2i+1)x ⁽⁰⁾(i)=d ⁽⁰⁾(2i+1)x ⁽⁰⁾(i)=d ⁽⁰⁾(2i+1)x ⁽¹⁾(i)=d⁽⁰⁾(3i+1)

x ⁽²⁾(i)=d ⁽¹⁾(i),x ⁽²⁾(i)=d ⁽¹⁾(i),x ⁽¹⁾(i)=d ⁽¹⁾(i), and x ⁽²⁾(i)=d⁽⁰⁾(3i+2)

where the rank indication value is 3, d^((k))(q) indicates the q^(th)value of the k^(th) codeword, x^((p))=(n)d^((k))(q) indicates that theq^(th) value of the k^(th) codeword is mapped to the m^(th) layer, and pis a quantity of layers.

The first relationship set includes at least two of the followingmapping relationships of mapping codewords to respective layers:

x ⁽⁰⁾(i)=d ⁽⁰⁾(2i)x ⁽⁰⁾(i)=d ⁽⁰⁾(2i)x ⁽⁰⁾(i)=d ⁽⁰⁾(2i)

x ⁽¹⁾(i)=d ⁽⁰⁾(2i+1)x ⁽²⁾(i)=d ⁽⁰⁾(2i+1)x ⁽³⁾(i)=d ⁽⁰⁾(2i+1)

x ⁽²⁾(i)=d ⁽¹⁾(2i)x ⁽¹⁾(i)=d ⁽¹⁾(2i)x ⁽¹⁾(i)=d ⁽¹⁾(2i)

x ⁽³⁾(i)=d ⁽¹⁾(2i+1)x ⁽³⁾(i)=d ⁽¹⁾(2i+1)x ⁽²⁾(i)=d ⁽¹⁾(2i+1)

x ⁽¹⁾(i)=d ⁽⁰⁾(2i)x ⁽¹⁾(i)=d ⁽⁰⁾(2i)x ⁽²⁾(i)=d ⁽⁰⁾(2i)x ⁽⁰⁾(i)=d ⁽⁰⁾(4i)

x ⁽²⁾(i)=d ⁽⁰⁾(2i+1)x ⁽³⁾(i)=d ⁽⁰⁾(2i+1)x ⁽³⁾(i)=d ⁽⁰⁾(2i+1)x ⁽¹⁾(i)=d⁽⁰⁾(4i+1)

x ⁽⁰⁾(i)=d ⁽¹⁾(2i)x ⁽⁰⁾(i)=d ⁽¹⁾(2i)x ⁽⁰⁾(i)=d ⁽¹⁾(2i)x ⁽²⁾(i)=d⁽⁰⁾(4i+2)

x ⁽³⁾(i)=d ⁽¹⁾(2i+1),x ⁽²⁾(i)=d ⁽¹⁾(2i+1),x ⁽¹⁾(i)=d ⁽¹⁾(2i+1), and x⁽³⁾(i)d ⁽⁰⁾(4i+3)

where the rank indication value is 4, d^((k))(q) indicates the q^(th)value of the k^(th) codeword, x^((p))(n)=d^((k))(q) indicates that theq^(th) value of the k^(th) codeword is mapped to the m^(th) layer, and pis a quantity of layers. Alternatively,

the first relationship set includes at least two of the followingmapping relationships of mapping codewords to respective layers:

x ⁽⁰⁾(i)=d ⁽⁰⁾(3i)x ⁽⁰⁾(i)=d ⁽⁰⁾(3i)x ⁽⁰⁾(i)=d ⁽⁰⁾(3i)

x ⁽¹⁾(i)=d ⁽⁰⁾(3i+1)x ⁽¹⁾(i)=d ⁽⁰⁾(3i+1)x ⁽¹⁾(i)=d ⁽⁰⁾(3i+1)

x ⁽²⁾(i)=d ⁽⁰⁾(3i+2)x ⁽³⁾(i)=d ⁽⁰⁾(3i+2)x ⁽⁴⁾(i)=d ⁽⁰⁾(3i+2)

x ⁽³⁾(i)=d ⁽⁰⁾(2i)x ⁽²⁾(i)=d ⁽¹⁾(2i)x ⁽²⁾(i)=d ⁽⁰⁾(2i)

x ⁽⁴⁾(i)=d ⁽¹⁾(2i+1)x ⁽⁴⁾(i)=d ⁽¹⁾(2i+1)x ⁽³⁾(i)=d ⁽¹⁾(2i+1)

x ⁽⁰⁾(i)=d ⁽⁰⁾(3i)x ⁽⁰⁾(i)=d ⁽⁰⁾(3i)x ⁽⁰⁾(i)=d ⁽⁰⁾(3i)x ⁽¹⁾(i)=d ⁽⁰⁾(3i)

x ⁽²⁾(i)=d ⁽⁰⁾(3i+1)x ⁽²⁾(i)=d ⁽⁰⁾(3i+1)x ⁽³⁾(i)=d ⁽⁰⁾(3i+1)x ⁽²⁾(i)=d⁽⁰⁾(3i+1)

x ⁽³⁾(i)=d ⁽⁰⁾(3i+2)x ⁽⁴⁾(i)=d ⁽⁰⁾(3i+2)x ⁽⁴⁾(i)=d ⁽⁰⁾(3i+2)x ⁽³⁾(i)=d⁽⁰⁾(3i+2)

x ⁽¹⁾(i)=d ⁽¹⁾(2i)x ⁽¹⁾(i)=d ⁽¹⁾(2i)x ⁽¹⁾(i)=d ⁽¹⁾(2i)x ⁽⁰⁾(i)=d ⁽¹⁾(2i)

x ⁽⁴⁾(i)=d ⁽¹⁾(2i+1)x ⁽³⁾(i)=d ⁽¹⁾(2i+1)x ⁽²⁾(i)=d ⁽¹⁾(2i+1)x ⁽⁴⁾(i)=d⁽¹⁾(2i+1)

x ⁽¹⁾(i)=d ⁽⁰⁾(3i)x ⁽¹⁾(i)=d ⁽⁰⁾(3i)x ⁽²⁾(i)=d ⁽⁰⁾(3i)x ⁽⁰⁾(i)=d ⁽⁰⁾(2i)

x ⁽²⁾(i)d ⁽⁰⁾(3i+1)x ⁽³⁾(i)=d ⁽⁰⁾(3i+1)x ⁽³⁾(i)=d ⁽⁰⁾(3i+1)x ⁽¹⁾(i)=d⁽⁰⁾(2i+1)

x ⁽⁴⁾(i)d ⁽⁰⁾(3i+2)x ⁽⁴⁾(i)=d ⁽⁰⁾(3i+2)x ⁽⁴⁾(i)=d ⁽⁰⁾(3i+2)x ⁽²⁾(i)=d⁽¹⁾(3i)

x ⁽⁰⁾(i)=d ⁽¹⁾(2i)x ⁽⁰⁾(i)=d ⁽¹⁾(2i)x ⁽⁰⁾(i)=d ⁽¹⁾(2i)x ⁽³⁾(i)=d⁽¹⁾(3i+1)

x ⁽³⁾(i)d ⁽¹⁾(2i+1)x ⁽¹⁾(i)=d ⁽¹⁾(2i+1)x ⁽¹⁾(i)=d ⁽¹⁾(2i+1)x ⁽⁴⁾(i)=d⁽¹⁾(3i+2)

x ⁽⁰⁾(i)=d ⁽⁰⁾(2i)x ⁽⁰⁾(i)=d ⁽⁰⁾(2i)x ⁽⁰⁾(i)=d ⁽⁰⁾(2i)x ⁽¹⁾(i)=d ⁽⁰⁾(2i)

x ⁽²⁾(i)=d ⁽⁰⁾(2i+1)x ⁽³⁾(i)=d ⁽⁰⁾(2i+1)x ⁽⁴⁾(i)=d ⁽⁰⁾(2i+1)x ⁽²⁾(i)=d⁽⁰⁾(2i+1)

x ⁽¹⁾(i)=d ⁽¹⁾(3i)x ⁽¹⁾(i)=d ⁽¹⁾(3i)x ⁽¹⁾(i)=d ⁽¹⁾(3i)x ⁽⁰⁾(i)=d ⁽¹⁾(3i)

x ⁽³⁾(i)=d ⁽¹⁾(3i+1)x ⁽²⁾(i)=d ⁽¹⁾(3 i+1)x ⁽²⁾(i)=d ⁽¹⁾(3 i+1)x ⁽³⁾(i)=d⁽¹⁾(3 i+1)

x ⁽⁴⁾(i)=d ⁽¹⁾(3 i+2),x ⁽⁴⁾(i)=d ⁽¹⁾(3 i+2),x ⁽³⁾(i)=d ⁽¹⁾(3 i+2),x⁽⁴⁾(i)=d ⁽¹⁾(3 i+2),

x ⁽¹⁾(i)=d ⁽⁰⁾(2i)x ⁽¹⁾(i)=d ⁽⁰⁾(2i)x ⁽²⁾(i)=d ⁽⁰⁾(2i)x ⁽²⁾(i)=d ⁽⁰⁾(2i)

x ⁽³⁾(i)=d ⁽⁰⁾(2i+1)x ⁽⁴⁾(i)=d ⁽⁰⁾(2i+1)x ⁽³⁾(i)=d ⁽⁰⁾(2i+1)x ⁽⁴⁾(i)=d⁽⁰⁾(2i+1)

x ⁽⁰⁾(i)=d ⁽¹⁾(3i)x ⁽⁰⁾(i)=d ⁽¹⁾(3i)x ⁽⁰⁾(i)=d ⁽¹⁾(3i)x ⁽⁰⁾(i)=d ⁽¹⁾(3i)

x ⁽²⁾(i)=d ⁽¹⁾(3i+1)x ⁽²⁾(i)=d ⁽¹⁾(3i+1)x ⁽¹⁾(i)=d ⁽¹⁾(3i+1)x ⁽¹⁾(i)=d⁽¹⁾(3i+1)

x ⁽⁴⁾(i)=d ⁽¹⁾(3i+2),x ⁽³⁾(i)=d ⁽¹⁾(3i+2),x ⁽⁴⁾(i)=d ⁽¹⁾(3i+2),x⁽³⁾(i)=d ⁽¹⁾(3i+2)

x ⁽³⁾(i)=d ⁽⁰⁾(2i)x ⁽⁰⁾(i)=d ⁽⁰⁾(5i)

x ⁽⁴⁾(i)=d ⁽⁰⁾(2i+1)x ⁽¹⁾(i)=d ⁽⁰⁾(5i+1)

x ⁽⁰⁾(i)=d ⁽¹⁾(3i)x ⁽²⁾(i)=d ⁽⁰⁾(5i+2)

x ⁽¹⁾(i)=d ⁽¹⁾(3i+1)x ⁽³⁾(i)=d ⁽⁰⁾(5i+3)

x ⁽²⁾(i)=d ⁽¹⁾(3i+ ²), and x ⁽⁴⁾(i)=d ⁽⁰⁾(5i+4)

where the rank indication value is 5, d^((k))(q) indicates the q^(th)value of the k^(th) codeword, x^((p))(n)=d^((k))(q) indicates that theq^(th) value of the k^(th) codeword is mapped to the m^(th) layer, and pis a quantity of layers. Alternatively,

the first relationship set includes at least two of the followingmapping relationships of mapping codewords to respective layers:

x ⁽⁰⁾(i)=d ⁽⁰⁾(3i)x ⁽⁰⁾(i)=d ⁽⁰⁾(3i)x ⁽⁰⁾(i)=d ⁽⁰⁾(3i)

x ⁽¹⁾(i)=d ⁽⁰⁾(3i+1)x ⁽¹⁾(i)=d ⁽⁰⁾(3i+1)x ⁽¹⁾(i)=d ⁽⁰⁾(3i+1)

x ⁽²⁾(i)=d ⁽⁰⁾(3i+2)x ⁽³⁾(i)=d ⁽⁰⁾(3i+2)x ⁽⁴⁾(i)=d ⁽⁰⁾(3i+2)

x ⁽³⁾(i)=d ⁽¹⁾(3i)x ⁽²⁾(i)=d ⁽¹⁾(3i)x ⁽²⁾(i)=d ⁽¹⁾(3i)

x ⁽⁴⁾(i)=d ⁽¹⁾(3i+1)x ⁽⁴⁾(i)=d ⁽¹⁾(3i+1)x ⁽³⁾(i)=d ⁽¹⁾(3i+1)

x ⁽⁵⁾(i)=d ⁽¹⁾(3i+2),x ⁽⁵⁾(i)=d ⁽¹⁾(3i+2),x ⁽⁵⁾(i)=d ⁽¹⁾(3i+2),

x ⁽⁰⁾(i)=d ⁽⁰⁾(3i)x ⁽⁰⁾(i)=d ⁽⁰⁾(3i)x ⁽⁰⁾(i)=d ⁽⁰⁾(3i)x ⁽⁰⁾(i)=d ⁽⁰⁾(3i)

x ⁽¹⁾(i)=d ⁽⁰⁾(3i+1)x ⁽²⁾(i)=d ⁽⁰⁾(3i+1)x ⁽²⁾(i)=d ⁽⁰⁾(3i+1)x ⁽²⁾(i)=d⁽⁰⁾(3i+1)

x ⁽⁵⁾(i)=d ⁽⁰⁾(3i+2)x ⁽³⁾(i)=d ⁽⁰⁾(3i+2)x ⁽⁴⁾(i)=d ⁽⁰⁾(3i+2)x ⁽⁵⁾(i)=d⁽⁰⁾(3i+2)

x ⁽²⁾(i)=d ⁽¹⁾(3i)x ⁽¹⁾(i)=d ⁽¹⁾(3i)x ⁽¹⁾(i)=d ⁽¹⁾(3i)x ⁽¹⁾(i)=d ⁽¹⁾(3i)

x ⁽³⁾(i)=d ⁽¹⁾(3i+1)x ⁽⁴⁾(i)=d ⁽¹⁾(3i+1)x ⁽³⁾(i)=d ⁽¹⁾(3i+1)x ⁽³⁾(i)=d⁽¹⁾(3i+1)

x ⁽⁴⁾(i)=d ⁽¹⁾(3i+2)x ⁽⁵⁾(i)=d ⁽¹⁾(3i+2)x ⁽⁵⁾(i)=d ⁽¹⁾(3i+2)x ⁽⁴⁾(i)=d⁽¹⁾(3i+2)

x ⁽⁰⁾(i)=d ⁽⁰⁾(3i)x ⁽⁰⁾(i)=d ⁽⁰⁾(3i)x ⁽⁰⁾(i)=d ⁽⁰⁾(3i)x ⁽¹⁾(i)=d ⁽⁰⁾(3i)

x ⁽³⁾(i)=d ⁽⁰⁾(3i+1)x ⁽³⁾(i)=d ⁽⁰⁾(3i+1)x ⁽⁴⁾(i)=d ⁽⁰⁾(3i+1)x ⁽²⁾(i)=d⁽⁰⁾(3i+1)

x ⁽⁴⁾(i)=d ⁽⁰⁾(3i+2)x ⁽⁵⁾(i)=d ⁽⁰⁾(3i+2)x ⁽⁵⁾(i)=d ⁽⁰⁾(3i+2)x ⁽³⁾(i)=d⁽⁰⁾(3i+2)

x ⁽¹⁾(i)=d ⁽¹⁾(3i)x ⁽¹⁾(i)=d ⁽¹⁾(3i)x ⁽¹⁾(i)=d ⁽¹⁾(3i)x ⁽⁴⁾(i)=d ⁽¹⁾(3i)

x ⁽²⁾(i)=d ⁽¹⁾(3i+1)x ⁽²⁾(i)=d ⁽¹⁾(3i+1)x ⁽²⁾(i)=d ⁽¹⁾(3i+1)x ⁽⁵⁾(i)=d⁽¹⁾(3i+1)

x ⁽⁵⁾(i)=d ⁽¹⁾(3i+2),x ⁽⁴⁾(i)=d ⁽¹⁾(3i+2),x ⁽³⁾(i)=d ⁽¹⁾(3i+2),x⁽⁶⁾(i)=d ⁽¹⁾(3i+2)

x ⁽¹⁾(i)=d ⁽⁰⁾(3i)x ⁽¹⁾(i)=d ⁽⁰⁾(3i)x ⁽¹⁾(i)=d ⁽⁰⁾(3i)x ⁽¹⁾(i)=d ⁽⁰⁾(3i)

x ⁽²⁾(i)=d ⁽⁰⁾(3i+1)x ⁽²⁾(i)=d ⁽⁰⁾(3i+1)x ⁽³⁾(i)=d ⁽⁰⁾(3i+1)x ⁽³⁾(i)=d⁽⁰⁾(3i+1)

x ⁽⁴⁾(i)=d ⁽⁰⁾(3i+2)x ⁽⁵⁾(i)=d ⁽⁰⁾(3i+2)x ⁽⁴⁾(i)=d ⁽⁰⁾(3i+2)x ⁽⁵⁾(i)=d⁽⁰⁾(3i+2)

x ⁽⁰⁾(i)=d ⁽¹⁾(3i)x ⁽⁰⁾(i)=d ⁽¹⁾(3i)x ⁽⁰⁾(i)=d ⁽¹⁾(3i)x ⁽⁰⁾(i)=d ⁽¹⁾(3i)

x ⁽³⁾(i)=d ⁽¹⁾(3i+1)x ⁽³⁾(i)=d ⁽¹⁾(3i+1)x ⁽²⁾(i)=d ⁽¹⁾(3i+1)x ⁽²⁾(i)=d⁽¹⁾(3i+1)

x ⁽⁵⁾(i)=d ⁽¹⁾(3i+2),x ⁽⁴⁾(i)=d ⁽¹⁾(3i+2),x ⁽⁵⁾(i)=d ⁽¹⁾(3i+2),x⁽⁴⁾(i)=d ⁽¹⁾(3i+2)

x ⁽¹⁾(i)=d ⁽⁰⁾(3i)x ⁽²⁾(i)=d ⁽⁰⁾(3i)x ⁽²⁾(i)=d ⁽⁰⁾(3i)x ⁽²⁾(i)=d ⁽⁰⁾(3i)

x ⁽⁴⁾(i)=d ⁽⁰⁾(3i+1)x ⁽³⁾(i)=d ⁽⁰⁾(3i+1)x ⁽³⁾(i)=d ⁽⁰⁾(3i+1)x ⁽⁴⁾(i)=d⁽⁰⁾(3i+1)

x ⁽⁵⁾(i)=d ⁽⁰⁾(3i+2)x ⁽⁴⁾(i)=d ⁽⁰⁾(3i+2)x ⁽⁵⁾(i)=d ⁽⁰⁾(3i+2)x ⁽⁵⁾(i)=d⁽⁰⁾(3i+2)

x ⁽⁰⁾(i)=d ⁽¹⁾(3i)x ⁽⁰⁾(i)=d ⁽¹⁾(3i)x ⁽⁰⁾(i)=d ⁽¹⁾(3i)x ⁽⁰⁾(i)=d ⁽¹⁾(3i)

x ⁽²⁾(i)=d ⁽¹⁾(3i+1)x ⁽¹⁾(i)=d ⁽¹⁾(3i+1)x ⁽¹⁾(i)=d ⁽¹⁾(3i+1)x ⁽¹⁾(i)=d⁽¹⁾(3i+1)

x ⁽³⁾(i)=d ⁽¹⁾(3i+2),x ⁽⁵⁾(i)=d ⁽¹⁾(3i+2),x ⁽⁴⁾(i)=d ⁽¹⁾(3i+2),x⁽³⁾(i)=d ⁽¹⁾(3i+2)

x ⁽³⁾(i)=d ⁽⁰⁾(3i)x ⁽⁰⁾(i)=d ⁽⁰⁾(6i)

x ⁽⁴⁾(i)=d ⁽⁰⁾(3i+1)x ⁽¹⁾(i)=d ⁽⁰⁾(6i+1)

x ⁽⁵⁾(i)=d ⁽⁰⁾(3i+2)x ⁽²⁾(i)=d ⁽⁰⁾(6i+2)

x ⁽⁰⁾(i)=d ⁽¹⁾(3i)x ⁽³⁾(i)=d ⁽⁰⁾(6i+3)

x ⁽¹⁾(i)=d ⁽¹⁾(3i+1)x ⁽⁴⁾(i)=d ⁽⁰⁾(6i+4)

x ⁽²⁾(i)d ⁽¹⁾(3i+2), and x ⁽⁵⁾(i)d ⁽⁰⁾(6i+5),

where the rank indication value is 6, d^((k))(q) indicates the q^(th)value of the k^(th) codeword, x^((p))(n)=d^((k))(q) indicates that theq^(th) value of the k^(th) codeword is mapped to the m^(th) layer, and pis a quantity of layers. Alternatively, the first relationship setincludes at least two of the following mapping relationships of mappingcodewords to respective layers:

x ⁽⁰⁾(i)=d ⁽⁰⁾(3i)x ⁽⁰⁾(i)=d ⁽⁰⁾(3i)x ⁽⁰⁾(i)=d ⁽⁰⁾(3i)

x ⁽¹⁾(i)=d ⁽⁰⁾(3i+1)x ⁽¹⁾(i)=d ⁽⁰⁾(3i+1)x ⁽¹⁾(i)=d ⁽⁰⁾(3i+1)

x ⁽²⁾(i)=d ⁽⁰⁾(3i+2)x ⁽³⁾(i)=d ⁽⁰⁾(3i+2)x ⁽⁴⁾(i)=d ⁽⁰⁾(3i+2)

x ⁽³⁾(i)=d ⁽¹⁾(4i)x ⁽²⁾(i)=d ⁽¹⁾(4i)x ⁽²⁾(i)=d ⁽¹⁾(4i)

x ⁽⁴⁾(i)=d ⁽¹⁾(4i+1)x ⁽⁴⁾(i)=d ⁽¹⁾(4i+1)x ⁽³⁾(i)=d ⁽¹⁾(4i+1)

x ⁽⁵⁾(i)=d ⁽¹⁾(4i+2)x ⁽⁵⁾(i)=d ⁽¹⁾(4i+2)x ⁽⁵⁾(i)=d ⁽¹⁾(4i+2)

x ⁽⁶⁾(i)=d ⁽¹⁾(4i+3),x ⁽⁶⁾(i)=d ⁽¹⁾(4i+3),x ⁽⁶⁾(i)=d ⁽¹⁾(4i+3),

x ⁽⁰⁾(i)=d ⁽⁰⁾(3i)x ⁽⁰⁾(i)=d ⁽⁰⁾(3i)x ⁽⁰⁾(i)=d ⁽⁰⁾(3i)x ⁽⁰⁾(i)=d ⁽⁰⁾(3i)

x ⁽¹⁾(i)=d ⁽⁰⁾(3i+1)x ⁽¹⁾(i)=d ⁽⁰⁾(3i+1)x ⁽²⁾(i)=d ⁽⁰⁾(3i+1)x ⁽²⁾(i)=d⁽⁰⁾(3i+1)

x ⁽⁵⁾(i)=d ⁽⁰⁾(3i+2)x ⁽⁶⁾(i)=d ⁽⁰⁾(3i+2)x ⁽³⁾(i)=d ⁽⁰⁾(3i+2)x ⁽⁴⁾(i)=d⁽⁰⁾(3i+2)

x ⁽²⁾(i)=d ⁽¹⁾(4i)x ⁽²⁾(i)=d ⁽¹⁾(4i)x ⁽¹⁾(i)=d ⁽¹⁾(4i)x ⁽¹⁾(i)=d ⁽¹⁾(4i)

x ⁽³⁾(i)=d ⁽¹⁾(4i+1)x ⁽³⁾(i)=d ⁽¹⁾(4i+1)x ⁽⁴⁾(i)=d ⁽¹⁾(4i+1)x ⁽²⁾(i)=d⁽¹⁾(4i+1)

x ⁽⁴⁾(i)=d ⁽¹⁾(4i+2)x ⁽⁴⁾(i)=d ⁽¹⁾(4i+2)x ⁽⁵⁾(i)=d ⁽¹⁾(4i+2)x ⁽⁵⁾(i)=d⁽¹⁾(4i+2)

x ⁽⁶⁾(i)=d ⁽¹⁾(4i+3),x ⁽⁵⁾(i)=d ⁽¹⁾(4i+3),x ⁽⁶⁾(i)=d ⁽¹⁾(4i+3),x⁽⁶⁾(i)=d ⁽¹⁾(4i+3)

x ⁽⁰⁾(i)=d ⁽⁰⁾(3i)x ⁽⁰⁾(i)=d ⁽⁰⁾(3i)x ⁽⁰⁾(i)=d ⁽⁰⁾(3i)x ⁽⁰⁾(i)=d ⁽⁰⁾(3i)

x ⁽²⁾(i)=d ⁽⁰⁾(3i+1)x ⁽²⁾(i)=d ⁽⁰⁾(3i+1)x ⁽³⁾(i)=d ⁽⁰⁾(3i+1)x ⁽³⁾(i)=d⁽⁰⁾(3i+1)

x ⁽⁵⁾(i)=d ⁽⁰⁾(3i+2)x ⁽⁶⁾(i)=d ⁽⁰⁾(3i+2)x ⁽⁴⁾(i)=d ⁽⁰⁾(3i+2)x ⁽⁵⁾(i)=d⁽⁰⁾(3i+2)

x ⁽¹⁾(i)=d ⁽¹⁾(4i)x ⁽¹⁾(i)=d ⁽¹⁾(4i)x ⁽¹⁾(i)=d ⁽¹⁾(4i)x ⁽¹⁾(i)=d ⁽¹⁾(4i)

x ⁽³⁾(i)=d ⁽¹⁾(4i+1)x ⁽³⁾(i)=d ⁽¹⁾(4i+1)x ⁽²⁾(i)=d ⁽¹⁾(4i+1)x ⁽²⁾(i)=d⁽¹⁾(4i+1)

x ⁽⁴⁾(i)=d ⁽¹⁾(4i+2)x ⁽⁴⁾(i)=d ⁽¹⁾(4i+2)x ⁽⁵⁾(i)=d ⁽¹⁾(4i+2)x ⁽⁴⁾(i)=d⁽¹⁾(4i+2)

x ⁽⁶⁾(i)=d ⁽¹⁾(4i+3),x ⁽⁵⁾(i)=d ⁽¹⁾(4i+3),x ⁽⁶⁾(i)=d ⁽¹⁾(4i+3),x⁽⁶⁾(i)=d ⁽¹⁾(4i+3),

x ⁽⁰⁾(i)=d ⁽⁰⁾(3i)x ⁽⁰⁾(i)=d ⁽⁰⁾(3i)x ⁽⁰⁾(i)=d ⁽⁰⁾(3i)x ⁽⁰⁾(i)=d ⁽⁰⁾(3i)

x ⁽³⁾(i)=d ⁽⁰⁾(3i+1)x ⁽⁴⁾(i)=d ⁽⁰⁾(3i+1)x ⁽⁴⁾(i)=d ⁽⁰⁾(3i+1)x ⁽⁵⁾(i)=d⁽⁰⁾(3i+1)

x ⁽⁶⁾(i)=d ⁽⁰⁾(3i+2)x ⁽⁵⁾(i)=d ⁽⁰⁾(3i+2)x ⁽⁶⁾(i)=d ⁽⁰⁾(3i+2)x ⁽⁶⁾(i)=d⁽⁰⁾(3i+2)

x ⁽¹⁾(i)=d ⁽¹⁾(4i)x ⁽¹⁾(i)=d ⁽¹⁾(4i)x ⁽¹⁾(i)=d ⁽¹⁾(4i)x ⁽¹⁾(i)=d ⁽¹⁾(4i)

x ⁽²⁾(i)=d ⁽¹⁾(4i+1)x ⁽²⁾(i)=d ⁽¹⁾(4i+1)x ⁽²⁾(i)=d ⁽¹⁾(4i+1)x ⁽²⁾(i)=d⁽¹⁾(4+1)

x ⁽⁴⁾(i)=d ⁽¹⁾(4i+2)x ⁽³⁾(i)=d ⁽¹⁾(4i+2)x ⁽³⁾(i)=d ⁽¹⁾(4i+2)x ⁽³⁾(i)=d⁽¹⁾(4i+2)

x ⁽⁵⁾(i)=d ⁽¹⁾(4i+3),x ⁽⁶⁾(i)=d ⁽¹⁾(4i+3),x ⁽⁵⁾(i)=d ⁽¹⁾(4i+3),x⁽⁴⁾(i)=d ⁽¹⁾(4i+3),

x ⁽¹⁾(i)=d ⁽⁰⁾(3i)x ⁽¹⁾(i)=d ⁽⁰⁾(3i)x ⁽¹⁾(i)=d ⁽⁰⁾(3i)x ⁽¹⁾(i)=d ⁽⁰⁾(3i)

x ⁽²⁾(i)=d ⁽⁰⁾(3i+1)x ⁽²⁾(i)=d ⁽⁰⁾(3i+1)x ⁽²⁾(i)=d ⁽⁰⁾(3i+1)x ⁽²⁾(i)=d⁽⁰⁾(3i+1)

x ⁽³⁾(i)=d ⁽⁰⁾(3i+2)x ⁽⁴⁾(i)=d ⁽⁰⁾(3i+2)x ⁽⁵⁾(i)=d ⁽⁰⁾(3i+2)x ⁽⁶⁾(i)=d⁽⁰⁾(3i+2)

x ⁽⁰⁾(i)=d ⁽¹⁾(4i)x ⁽⁰⁾(i)=d ⁽¹⁾(4i)x ⁽⁰⁾(i)=d ⁽¹⁾(4i)x ⁽⁰⁾(i)=d ⁽¹⁾(4i)

x ⁽⁴⁾(i)=d ⁽¹⁾(4i+1)x ⁽²⁾(i)=d ⁽¹⁾(4i+1)x ⁽³⁾(i)=d ⁽¹⁾(4i+1)x ⁽³⁾(i)=d⁽¹⁾(4i+1)

x ⁽⁵⁾(i)=d ⁽¹⁾(4i+2)x ⁽⁵⁾(i)=d ⁽¹⁾(4i+2)x ⁽⁴⁾(i)=d(i)(4i+2)x⁽⁴⁾(i)=d(i)(4i+2)

x ⁽⁶⁾(i)=d ⁽¹⁾(4i+3),x ⁽⁶⁾(i)=d ⁽¹⁾(4i+3),x ⁽⁶⁾(i)=d ⁽¹⁾(4i+3),x⁽⁵⁾(i)=d ⁽¹⁾(4i+3),

x ⁽¹⁾(i)=d ⁽⁰⁾(3i)x ⁽¹⁾(i)=d ⁽⁰⁾(3i)x ⁽¹⁾(i)=d ⁽⁰⁾(3i)x ⁽¹⁾(i)=d ⁽⁰⁾(3i)

x ⁽³⁾(i)=d ⁽⁰⁾(3i+1)x ⁽³⁾(i)=d ⁽⁰⁾(3i+1)x ⁽³⁾(i)=d ⁽⁰⁾(3i+1)x ⁽⁴⁾(i)=d⁽⁰⁾(3i+1)

x ⁽⁴⁾(i)=d ⁽⁰⁾(3i+2)x ⁽⁵⁾(i)=d ⁽⁰⁾(3i+2)x ⁽⁶⁾(i)=d ⁽⁰⁾(3i+2)x ⁽⁵⁾(i)=d⁽⁰⁾(3i+2)

x ⁽⁰⁾(i)=d ⁽¹⁾(4i)x ⁽⁰⁾(i)=d ⁽¹⁾(4i)x ⁽⁰⁾(i)=d ⁽¹⁾(4i)x ⁽⁰⁾(i)=d ⁽¹⁾(4i)

x ⁽²⁾(i)=d ⁽¹⁾(4i+1)x ⁽²⁾(i)=d ⁽¹⁾(4i+1)x ⁽²⁾(i)=d ⁽¹⁾(4i+1)x ⁽²⁾(i)=d⁽¹⁾(4i+1)

x ⁽⁵⁾(i)=d ⁽¹⁾(4i+2)x ⁽⁴⁾(i)=d ⁽¹⁾(4i+2)x ⁽⁴⁾(i)=d ⁽¹⁾(4i+2)x ⁽³⁾(i)=d⁽¹⁾(4i+2)

x ⁽⁶⁾(i)=d ⁽¹⁾(4i+3),x ⁽⁶⁾(i)=d ⁽¹⁾(4i+3),x ⁽⁵⁾(i)=d ⁽¹⁾(4i+3),x⁽⁶⁾(i)=d ⁽¹⁾(4i+3),

x ⁽¹⁾(i)=d ⁽⁰⁾(3i)x ⁽¹⁾(i)=d ⁽⁰⁾(3i)x ⁽²⁾(i)=d ⁽⁰⁾(3i)x ⁽²⁾(i)=d ⁽⁰⁾(3i)

x ⁽⁴⁾(i)=d ⁽⁰⁾(3i+1)x ⁽⁵⁾(i)=d ⁽⁰⁾(3i+1)x ⁽³⁾(i)=d ⁽⁰⁾(3i+1)x ⁽³⁾(i)=d⁽⁰⁾(3i+1)

x ⁽⁶⁾(i)=d ⁽⁰⁾(3i+2)x ⁽⁶⁾(i)=d ⁽⁰⁾(3i+2)x ⁽⁴⁾(i)=d ⁽⁰⁾(3i+2)x ⁽⁵⁾(i)=d⁽⁰⁾(3i+2)

x ⁽⁰⁾(i)=d ⁽¹⁾(4i)x ⁽⁰⁾(i)=d ⁽¹⁾(4i)x ⁽⁰⁾(i)=d ⁽¹⁾(4i)x ⁽⁰⁾(i)=d ⁽¹⁾(4i)

x ⁽²⁾(i)=d ⁽¹⁾(4i+1)x ⁽²⁾(i)=d ⁽¹⁾(4i+1)x ⁽¹⁾(i)=d ⁽¹⁾(4i+1)x ⁽²⁾(i)=d⁽¹⁾(4i+1)

x ⁽³⁾(i)=d ⁽¹⁾(4i+2)x ⁽³⁾(i)=d ⁽¹⁾(4i+2)x ⁽⁵⁾(i)=d ⁽¹⁾(4i+2)x ⁽⁴⁾(i)=d⁽¹⁾(4i+2)

x ⁽⁵⁾(i)=d ⁽¹⁾(4i+3),x ⁽⁴⁾(i)=d ⁽¹⁾(4i+3),x ⁽⁶⁾(i)=d ⁽¹⁾(4i+3),x⁽⁶⁾(i)=d ⁽¹⁾(4i+3)

x ⁽²⁾(i)=d ⁽⁰⁾(3i)x ⁽²⁾(i)=d ⁽⁰⁾(3i)x ⁽²⁾(i)=d ⁽⁰⁾(3i)x ⁽²⁾(i)=d ⁽⁰⁾(3i)

x ⁽³⁾(i)=d ⁽⁰⁾(3i+1)x ⁽⁴⁾(i)=d ⁽⁰⁾(3i+1)x ⁽⁴⁾(i)=d ⁽⁰⁾(3i+1)x ⁽⁵⁾(i)=d⁽⁰⁾(3i+1)

x ⁽⁶⁾(i)=d ⁽⁰⁾(3i+2)x ⁽⁵⁾(i)=d ⁽⁰⁾(3i+2)x ⁽⁶⁾(i)=d ⁽⁰⁾(3i+2)x ⁽⁶⁾(i)=d⁽⁰⁾(3i+2)

x ⁽⁰⁾(i)=d ⁽¹⁾(4i)x ⁽⁰⁾(i)=d ⁽¹⁾(4i)x ⁽⁰⁾(i)=d ⁽¹⁾(4i)x ⁽⁰⁾(i)=d ⁽¹⁾(4i)

x ⁽¹⁾(i)=d ⁽¹⁾(4i+1)x ⁽¹⁾(i)=d ⁽¹⁾(4i+1)x ⁽¹⁾(i)=d ⁽¹⁾(4i+1)x ⁽¹⁾(i)=d⁽¹⁾(4i+1)

x ⁽⁴⁾(i)=d ⁽¹⁾(4i+2)x ⁽³⁾(i)=d ⁽¹⁾(4i+2)x ⁽³⁾(i)=d ⁽¹⁾(4i+2)x ⁽³⁾(i)=d⁽¹⁾(4i+2)

x ⁽⁵⁾(i)=d ⁽¹⁾(4i+3),x ⁽⁶⁾(i)=d ⁽¹⁾(4i+3),x ⁽⁵⁾(i)=d ⁽¹⁾(4i+3),x⁽⁴⁾(i)=d ⁽¹⁾(4i+3),

x ⁽³⁾(i)=d ⁽⁰⁾(3i)x ⁽³⁾(i)=d ⁽⁰⁾(3i)x ⁽³⁾(i)=d ⁽⁰⁾(3i)x ⁽⁴⁾(i)=d ⁽⁰⁾(3i)

x ⁽⁴⁾(i)=d ⁽⁰⁾(3i+1)x ⁽⁴⁾(i)=d ⁽⁰⁾(3i+1)x ⁽⁵⁾(i)=d ⁽⁰⁾(3i+1)x ⁽⁵⁾(i)=d⁽⁰⁾(3i+1)

x ⁽⁵⁾(i)=d ⁽⁰⁾(3i+2)x ⁽⁶⁾(i)=d ⁽⁰⁾(3i+2)x ⁽⁶⁾(i)=d ⁽⁰⁾(3i+2)x ⁽⁶⁾(i)=d⁽⁰⁾(3i+2)

x ⁽⁰⁾(i)=d ⁽¹⁾(4i)x ⁽⁰⁾(i)=d ⁽¹⁾(4i)x ⁽⁰⁾(i)=d ⁽¹⁾(4i)x ⁽⁰⁾(i)=d ⁽¹⁾(4i)

x ⁽¹⁾(i)=d ⁽¹⁾(4i+1)x ⁽¹⁾(i)=d ⁽¹⁾(4i+1)x ⁽¹⁾(i)=d ⁽¹⁾(4i+1)x ⁽¹⁾(i)=d⁽¹⁾(4i+1)

x ⁽²⁾(i)=d ⁽¹⁾(4i+2)x ⁽²⁾(i)=d ⁽¹⁾(4i+2)x ⁽²⁾(i)=d ⁽¹⁾(4i+2)x ⁽²⁾(i)=d⁽¹⁾(4i+2)

x ⁽⁶⁾(i)=d ⁽¹⁾(4i+3),x ⁽⁵⁾(i)=d ⁽¹⁾(4i+3),x ⁽⁴⁾(i)=d ⁽¹⁾(4i+3),x⁽³⁾(i)=d ⁽¹⁾(4i+3),

x ⁽³⁾(i)=d ⁽⁰⁾(4i)x ⁽²⁾(i)=d ⁽⁰⁾(4i)x ⁽²⁾(i)=d ⁽⁰⁾(4i)x ⁽²⁾(i)=d ⁽⁰⁾(4i)

x ⁽⁴⁾(i)=d ⁽⁰⁾(4i+1)x ⁽⁴⁾(i)=d ⁽⁰⁾(4i+1)x ⁽³⁾(i)=d ⁽⁰⁾(4i+1)x ⁽³⁾(i)=d⁽⁰⁾(4i+1)

x ⁽⁵⁾(i)=d ⁽⁰⁾(4i+2)x ⁽⁵⁾(i)=d ⁽⁰⁾(4i+2)x ⁽⁵⁾(i)=d ⁽⁰⁾(4i+2)x ⁽⁴⁾(i)=d⁽⁰⁾(4i+2)

x ⁽⁶⁾(i)=d ⁽¹⁾(4i+3)x ⁽⁶⁾(i)=d ⁽¹⁾(4i+3)x ⁽⁶⁾(i)=d ⁽¹⁾(4i+3)x ⁽⁶⁾(i)=d⁽¹⁾(4i+3)

x ⁽⁰⁾(i)=d ⁽¹⁾(3i)x ⁽⁰⁾(i)=d ⁽¹⁾(3i)x ⁽⁰⁾(i)=d ⁽¹⁾(3i)x ⁽⁰⁾(i)=d ⁽¹⁾(3i)

x ⁽¹⁾(i)=d ⁽¹⁾(3i+1)x ⁽¹⁾(i)=d ⁽¹⁾(3i+1)x ⁽¹⁾(i)=d ⁽¹⁾(3i+1)x ⁽¹⁾(i)=d⁽¹⁾(3i+1)

x ⁽²⁾(i)=d ⁽¹⁾(3i+2),x ⁽³⁾(i)=d ⁽¹⁾(3i+2),x ⁽⁴⁾(i)=d ⁽¹⁾(3i+2),x⁽⁵⁾(i)=d ⁽¹⁾(3i+2),

x ⁽²⁾(i)=d ⁽⁰⁾(4i)x ⁽¹⁾(i)=d ⁽⁰⁾(4i)x ⁽¹⁾(i)=d ⁽⁰⁾(4i)x ⁽¹⁾(i)=d ⁽⁰⁾(4i)

x ⁽³⁾(i)=d ⁽⁰⁾(4i+1)x ⁽⁴⁾(i)=d ⁽⁰⁾(4i+1)x ⁽³⁾(i)=d ⁽⁰⁾(4i+1)x ⁽³⁾(i)=d⁽⁰⁾(4i+1)

x ⁽⁴⁾(i)=d ⁽⁰⁾(4i+2)x ⁽⁵⁾(i)=d ⁽⁰⁾(4i+2)x ⁽⁵⁾(i)=d ⁽⁰⁾(4i+2)x ⁽⁴⁾(i)=d⁽⁰⁾(4i+2)

x ⁽⁵⁾(i)=d ⁽¹⁾(4i+3)x ⁽⁶⁾(i)=d ⁽¹⁾(4i+3)x ⁽⁶⁾(i)=d ⁽¹⁾(4i+3)x ⁽⁵⁾(i)=d⁽¹⁾(4i+3)

x ⁽⁰⁾(i)=d ⁽¹⁾(3i)x ⁽⁰⁾(i)=d ⁽¹⁾(3i)x ⁽⁰⁾(i)=d ⁽¹⁾(3i)x ⁽⁰⁾(i)=d ⁽¹⁾(3i)

x ⁽¹⁾(i)=d ⁽¹⁾(3i+1)x ⁽²⁾(i)=d ⁽¹⁾(3i+1)x ⁽²⁾(i)=d ⁽¹⁾(3i+1)x ⁽²⁾(i)=d⁽¹⁾(3i+1)

x ⁽⁶⁾(i)=d ⁽¹⁾(3i+2),x ⁽³⁾(i)=d ⁽¹⁾(3i+2),x ⁽⁴⁾(i)=d ⁽¹⁾(3i+2),x⁽⁵⁾(i)=d ⁽¹⁾(3i+2),

x ⁽¹⁾(i)=d ⁽⁰⁾(4i)x ⁽¹⁾(i)=d ⁽⁰⁾(4i)x ⁽¹⁾(i)=d ⁽⁰⁾(4i)x ⁽¹⁾(i)=d ⁽⁰⁾(4i)

x ⁽³⁾(i)=d ⁽⁰⁾(4i+1)x ⁽²⁾(i)=d ⁽⁰⁾(4i+1)x ⁽²⁾(i)=d ⁽⁰⁾(4i+1)x ⁽²⁾(i)=d⁽⁰⁾(4i+1)

x ⁽⁴⁾(i)=d ⁽⁰⁾(4i+2)x ⁽⁵⁾(i)=d ⁽⁰⁾(4i+2)x ⁽⁴⁾(i)=d ⁽⁰⁾(4i+2)x ⁽⁴⁾(i)=d⁽⁰⁾(4i+2)

x ⁽⁵⁾(i)=d ⁽¹⁾(4i+3)x ⁽⁶⁾(i)=d ⁽¹⁾(4i+3)x ⁽⁶⁾(i)=d ⁽¹⁾(4i+3)x ⁽⁵⁾(i)=d⁽¹⁾(4i+3)

x ⁽⁰⁾(i)=d ⁽¹⁾(3i)x ⁽⁰⁾(i)=d ⁽¹⁾(3i)x ⁽⁰⁾(i)=d ⁽¹⁾(3i)x ⁽⁰⁾(i)=d ⁽¹⁾(3i)

x ⁽²⁾(i)=d ⁽¹⁾(3i+1)x ⁽³⁾(i)=d ⁽¹⁾(3i+1)x ⁽³⁾(i)=d ⁽¹⁾(3i+1)x ⁽³⁾(i)=d⁽¹⁾(3i+1)

x ⁽⁶⁾(i)=d ⁽¹⁾(3i+2),x ⁽⁴⁾(i)=d ⁽¹⁾(3i+2),x ⁽⁵⁾(i)=d ⁽¹⁾(3i+2),x⁽⁶⁾(i)=d ⁽¹⁾(3i+2),

x ⁽¹⁾(i)=d ⁽⁰⁾(4i)x ⁽¹⁾(i)=d ⁽⁰⁾(4i)x ⁽¹⁾(i)=d ⁽⁰⁾(4i)x ⁽⁰⁾(i)=d ⁽⁰⁾(4i)

x ⁽²⁾(i)=d ⁽⁰⁾(4i+1)x ⁽²⁾(i)=d ⁽⁰⁾(4i+1)x ⁽²⁾(i)=d ⁽⁰⁾(4i+1)x ⁽⁴⁾(i)=d⁽⁰⁾(4i+1)

x ⁽³⁾(i)=d ⁽⁰⁾(4i+2)x ⁽³⁾(i)=d ⁽⁰⁾(4i+2)x ⁽³⁾(i)=d ⁽⁰⁾(4i+2)x ⁽⁵⁾(i)=d⁽⁰⁾(4i+2)

x ⁽⁶⁾(i)=d ⁽¹⁾(4i+3)x ⁽⁵⁾(i)=d ⁽¹⁾(4i+3)x ⁽⁴⁾(i)=d ⁽¹⁾(4i+3)x ⁽⁶⁾(i)=d⁽¹⁾(4i+3)

x ⁽⁰⁾(i)=d ⁽¹⁾(3i)x ⁽⁰⁾(i)=d ⁽¹⁾(3i)x ⁽⁰⁾(i)=d ⁽¹⁾(3i)x ⁽¹⁾(i)=d ⁽¹⁾(3i)

x ⁽⁴⁾(i)=d ⁽¹⁾(3i+1)x ⁽⁴⁾(i)=d ⁽¹⁾(3i+1)x ⁽⁵⁾(i)=d ⁽¹⁾(3i+1)x ⁽²⁾(i)=d⁽¹⁾(3i+1)

x ⁽⁵⁾(i)=d ⁽¹⁾(3i+2),x ⁽⁶⁾(i)=d ⁽¹⁾(3i+2),x ⁽⁶⁾(i)=d ⁽¹⁾(3i+2),x⁽³⁾(i)=d ⁽¹⁾(3i+2),

x ⁽⁰⁾(i)=d ⁽⁰⁾(4i)x ⁽⁰⁾(i)=d ⁽⁰⁾(4i)x ⁽⁰⁾(i)=d ⁽⁰⁾(4i)x ⁽⁰⁾(i)=d ⁽⁰⁾(4i)

x ⁽³⁾(i)=d ⁽⁰⁾(4i+1)x ⁽³⁾(i)=d ⁽⁰⁾(4i+1)x ⁽³⁾(i)=d ⁽⁰⁾(4i+1)x ⁽²⁾(i)=d⁽⁰⁾(4i+1)

x ⁽⁵⁾(i)=d ⁽⁰⁾(4i+2)x ⁽⁴⁾(i)=d ⁽⁰⁾(4i+2)x ⁽⁴⁾(i)=d ⁽⁰⁾(4i+2)x ⁽⁵⁾(i)=d⁽⁰⁾(4i+2)

x ⁽⁶⁾(i)=d ⁽¹⁾(4i+3)x ⁽⁵⁾(i)=d ⁽¹⁾(4i+3)x ⁽⁵⁾(i)=d ⁽⁰⁾(4i+3)x ⁽⁶⁾(i)=d⁽⁰⁾(4i+3)

x ⁽¹⁾(i)=d ⁽¹⁾(3i)x ⁽¹⁾(i)=d ⁽¹⁾(3i)x ⁽¹⁾(i)=d ⁽¹⁾(3i)x ⁽¹⁾(i)=d ⁽¹⁾(3i)

x ⁽²⁾(i)=d ⁽¹⁾(3i+1)x ⁽²⁾(i)=d ⁽¹⁾(3i+1)x ⁽²⁾(i)=d ⁽¹⁾(3i+1)x ⁽³⁾(i)=d⁽¹⁾(3i+1)

x ⁽⁴⁾(i)=d ⁽¹⁾(3i+2),x ⁽⁵⁾(i)=d ⁽¹⁾(3i+2),x ⁽⁶⁾(i)=d ⁽¹⁾(3i+2),x⁽⁴⁾(i)=d ⁽¹⁾(3i+2),

x ⁽⁰⁾(i)=d ⁽⁰⁾(4i)x ⁽⁰⁾(i)=d ⁽⁰⁾(4i)x ⁽⁰⁾(i)=d ⁽⁰⁾(4i)x ⁽⁰⁾(i)=d ⁽⁰⁾(4i)

x ⁽²⁾(i)=d ⁽⁰⁾(4i+1)x ⁽²⁾(i)=d ⁽⁰⁾(4i+1)x ⁽²⁾(i)=d ⁽⁰⁾(4i+1)x ⁽²⁾(i)=d⁽⁰⁾(4i+1)

x ⁽⁴⁾(i)=d ⁽⁰⁾(4i+2)x ⁽⁴⁾(i)=d ⁽⁰⁾(4i+2)x ⁽³⁾(i)=d ⁽⁰⁾(4i+2)x ⁽³⁾(i)=d⁽⁰⁾(4i+2)

x ⁽⁶⁾(i)=d ⁽¹⁾(4i+3)x ⁽⁵⁾(i)=d ⁽¹⁾(4i+3)x ⁽⁶⁾(i)=d ⁽¹⁾(4i+3)x ⁽⁵⁾(i)=d⁽¹⁾(4i+3)

x ⁽¹⁾(i)=d ⁽¹⁾(3i)x ⁽¹⁾(i)=d ⁽¹⁾(3i)x ⁽¹⁾(i)=d ⁽¹⁾(3i)x ⁽¹⁾(i)=d ⁽¹⁾(3i)

x ⁽³⁾(i)=d ⁽¹⁾(3i+1)x ⁽³⁾(i)=d ⁽¹⁾(3i+1)x ⁽⁴⁾(i)=d ⁽¹⁾(3i+1)x ⁽⁴⁾(i)=d⁽¹⁾(3i+1)

x ⁽⁵⁾(i)=d ⁽¹⁾(3i+2),x ⁽⁶⁾(i)=d ⁽¹⁾(3i+2),x ⁽⁵⁾(i)=d ⁽¹⁾(3i+2),x⁽⁶⁾(i)=d ⁽¹⁾(3i+2),

x ⁽⁰⁾(i)=d ⁽⁰⁾(4i)x ⁽⁰⁾(i)=d ⁽⁰⁾(4i)x ⁽⁰⁾(i)=d ⁽⁰⁾(4i)x ⁽⁰⁾(i)=d ⁽⁰⁾(4i)

x ⁽²⁾(i)=d ⁽⁰⁾(4i+1)x ⁽⁰⁾(i)=d ⁽⁰⁾(4i+1)x ⁽⁰⁾(i)=d ⁽⁰⁾(4i+1)x ⁽¹⁾(i)=d⁽⁰⁾(4i+1)

x ⁽³⁾(i)=d ⁽⁰⁾(4i+2)x ⁽⁵⁾(i)=d ⁽⁰⁾(4i+2)x ⁽⁴⁾(i)=d ⁽⁰⁾(4i+2)x ⁽⁴⁾(i)=d⁽⁰⁾(4i+2)

x ⁽⁴⁾(i)=d ⁽¹⁾(4i+3)x ⁽⁶⁾(i)=d ⁽¹⁾(4i+3)x ⁽⁶⁾(i)=d ⁽¹⁾(4i+3)x ⁽⁵⁾(i)=d⁽¹⁾(4i+3)

x ⁽¹⁾(i)=d ⁽¹⁾(3i)x ⁽²⁾(i)=d ⁽¹⁾(3i)x ⁽²⁾(i)=d ⁽¹⁾(3i)x ⁽²⁾(i)=d ⁽¹⁾(3i)

x ⁽⁵⁾(i)=d ⁽¹⁾(3i+1)x ⁽³⁾(i)=d ⁽¹⁾(3i+1)x ⁽³⁾(i)=d ⁽¹⁾(3i+1)x ⁽³⁾(i)=d⁽¹⁾(3i+1)

x ⁽⁶⁾(i)=d ⁽¹⁾(3i+2),x ⁽⁴⁾(i)=d ⁽¹⁾(3i+2),x ⁽⁵⁾(i)=d ⁽¹⁾(3i+2),x⁽⁶⁾(i)=d ⁽¹⁾(3i+2),

x ⁽⁰⁾(i)=d ⁽⁰⁾(4i)x ⁽⁰⁾(i)=d ⁽⁰⁾(4i)x ⁽⁰⁾(i)=d ⁽⁰⁾(4i)x ⁽⁰⁾(i)=d ⁽⁰⁾(4i)

x ⁽¹⁾(i)=d ⁽⁰⁾(4i+1)x ⁽¹⁾(i)=d ⁽⁰⁾(4i+1)x ⁽¹⁾(i)=d ⁽⁰⁾(4i+1)x ⁽¹⁾(i)=d⁽⁰⁾(4i+1)

x ⁽³⁾(i)=d ⁽⁰⁾(4i+2)x ⁽³⁾(i)=d ⁽⁰⁾(4i+2)x ⁽³⁾(i)=d ⁽⁰⁾(4i+2)x ⁽²⁾(i)=d⁽⁰⁾(4i+2)

x ⁽⁶⁾(i)=d ⁽¹⁾(4i+3)x ⁽⁵⁾(i)=d ⁽¹⁾(4i+3)x ⁽⁴⁾(i)=d ⁽¹⁾(4i+3)x ⁽⁶⁾(i)=d⁽¹⁾(4i+3)

x ⁽²⁾(i)=d ⁽¹⁾(3i)x ⁽²⁾(i)=d ⁽¹⁾(3i)x ⁽²⁾(i)=d ⁽¹⁾(3i)x ⁽³⁾(i)=d ⁽¹⁾(3i)

x ⁽⁴⁾(i)=d ⁽¹⁾(3i+1)x ⁽⁴⁾(i)=d ⁽¹⁾(3i+1)x ⁽⁵⁾(i)=d ⁽¹⁾(3i+1)x ⁽⁴⁾(i)=d⁽¹⁾(3i+1)

x ⁽⁵⁾(i)=d ⁽¹⁾(3i+2),x ⁽⁶⁾(i)=d ⁽¹⁾(3i+2),x ⁽⁶⁾(i)=d ⁽¹⁾(3i+2),x⁽⁵⁾(i)=d ⁽¹⁾(3i+2),

x ⁽⁰⁾(i)=d ⁽⁰⁾(4i)x ⁽⁰⁾(i)=d ⁽⁰⁾(4i)x ⁽⁰⁾(i)=d ⁽⁰⁾(4i)x ⁽⁰⁾(i)=d ⁽⁰⁾(7i)

x ⁽¹⁾(i)=d ⁽⁰⁾(4i+1)x ⁽¹⁾(i)=d ⁽⁰⁾(4i+1)x ⁽¹⁾(i)=d ⁽⁰⁾(4i+1)x ⁽¹⁾(i)=d⁽⁰⁾(7i+1)

x ⁽²⁾(i)=d ⁽⁰⁾(4i+2)x ⁽²⁾(i)=d ⁽⁰⁾(4i+2)x ⁽²⁾(i)=d ⁽⁰⁾(4i+2)x ⁽²⁾(i)=d⁽⁰⁾(7i+2)

x ⁽⁵⁾(i)=d ⁽⁰⁾(4i+3)x ⁽⁴⁾(i)=d ⁽⁰⁾(4i+3)x ⁽³⁾(i)=)d ⁽⁰⁾(4i+3)x ⁽³⁾(i)=d⁽¹⁾(7i+3)

x ⁽³⁾(i)=d ⁽¹⁾(3i)x ⁽³⁾(i)=d ⁽¹⁾(3i)x ⁽⁴⁾(i)=d ⁽¹⁾(3i)x ⁽⁴⁾(i)=d⁽⁰⁾(7i+4)

x ⁽⁴⁾(i)=d ⁽¹⁾(3i+1)x ⁽⁵⁾(i)=d ⁽¹⁾(3i+1)x ⁽⁵⁾(i)=d ⁽¹⁾(3i+1)x ⁽⁵⁾(i)=d⁽⁰⁾(7i+5)

x ⁽⁶⁾(i)=d ⁽¹⁾(3i+2)x ⁽⁶⁾(i)=d ⁽¹⁾(3i+2)x ⁽⁶⁾(i)=d ⁽¹⁾(3i+2), and x⁽⁶⁾(i)=d ⁽⁰⁾(7i+6)

where the rank indication value is 7, d^((k))(q) indicates the q^(th)value of the k^(th) codeword, x^((p))(n)=d^((k))(q) indicates that theq^(th) value of the k^(th) codeword is mapped to the m^(th) layer, and pis a quantity of layers. Alternatively, the first relationship setincludes at least two of the following mapping relationships of mappingcodewords to respective layers:

x ⁽⁰⁾(i)=d ⁽⁰⁾(4i)x ⁽⁰⁾(i)=d ⁽⁰⁾(4i)x ⁽⁰⁾(i)=d ⁽⁰⁾(4i)

x ⁽¹⁾(i)=d ⁽⁰⁾(4i+1)x ⁽¹⁾(i)=d ⁽⁰⁾(4i+1)x ⁽¹⁾(i)=d ⁽⁰⁾(4i+1)

x ⁽²⁾(i)=d ⁽⁰⁾(4i+2)x ⁽²⁾(i)=d ⁽⁰⁾(4i+2)x ⁽²⁾(i)=d ⁽⁰⁾(4i+2)

x ⁽³⁾(i)=d ⁽⁰⁾(4i+3)x ⁽⁴⁾(i)=d ⁽⁰⁾(4i+3)x ⁽⁵⁾(i)=d ⁽⁰⁾(4i+3)

x ⁽⁴⁾(i)=d ⁽¹⁾(4i)x ⁽³⁾(i)=d ⁽¹⁾(4i)x ⁽³⁾(i)=d ⁽¹⁾(4i)

x ⁽⁵⁾(i)=d ⁽¹⁾(4i+1)x ⁽⁵⁾(i)=d ⁽¹⁾(4i+1)x ⁽⁴⁾(i)=d ⁽¹⁾)(4i+1)

x ⁽⁶⁾(i)=d ⁽¹⁾(4i+2)x ⁽⁶⁾(i)=d ⁽¹⁾(4i+2)x ⁽⁶⁾(i)=d ⁽¹⁾(4i+2)

x ⁽⁷⁾(i)=d ⁽¹⁾(4i+3),x ⁽⁷⁾(i)=d ⁽¹⁾(4i+3),x ⁽⁷⁾(i)=d ⁽¹⁾(4i+3),

x ⁽⁰⁾(i)=d ⁽⁰⁾(4i)x ⁽⁰⁾(i)=d ⁽⁰⁾(4i)x ⁽⁰⁾(i)=d ⁽⁰⁾(4i)x ⁽⁰⁾(i)=d ⁽⁰⁾(4i)

x ⁽¹⁾(i)=d ⁽⁰⁾(4i+1)x ⁽¹⁾(i)=d ⁽⁰⁾(4i+1)x ⁽¹⁾(i)=d ⁽⁰⁾(4i+1)x ⁽¹⁾(i)=d⁽⁰⁾(4i+1)

x ⁽²⁾(i)=d ⁽⁰⁾(4i+2)x ⁽²⁾(i)=d ⁽⁰⁾(4i+2)x ⁽³⁾(i)=d ⁽⁰⁾(4i+2)x ⁽³⁾(i)=d⁽⁰⁾(4i+2)

x ⁽⁶⁾(i)=d ⁽¹⁾(4i+3)x ⁽⁷⁾(i)=d ⁽¹⁾(4i+3)x ⁽⁴⁾(i)=d ⁽⁰⁾(4i+3)x ⁽⁵⁾(i)=d⁽⁰⁾(4i+3)

x ⁽³⁾(i)=d ⁽¹⁾(4i)x ⁽³⁾(i)=d ⁽¹⁾(4i)x ⁽²⁾(i)=d ⁽¹⁾(4i)x ⁽²⁾(i)=d ⁽¹⁾(4i)

x ⁽⁴⁾(i)=d ⁽¹⁾(4i+1)x ⁽⁴⁾(i)=d ⁽¹⁾(4i+1)x ⁽⁵⁾(i)=d ⁽¹⁾(4i+1)x ⁽⁴⁾(i)=d⁽¹⁾(4i+1)

x ⁽⁵⁾(i)=d ⁽¹⁾(4i+2)x ⁽⁵⁾(i)=d ⁽¹⁾(4i+2)x ⁽⁶⁾(i)=d ⁽¹⁾(4i+2)x ⁽⁶⁾(i)=d⁽¹⁾(4i+2)

x ⁽⁷⁾(i)=d ⁽¹⁾(4i+3),x ⁽⁶⁾(i)=d ⁽¹⁾(4i+3),x ⁽⁷⁾(i)=d ⁽¹⁾(4i+3),x⁽⁷⁾(i)=d ⁽¹⁾(4i+3),

x ⁽⁰⁾(i)=d ⁽⁰⁾(4i)x ⁽⁰⁾(i)=d ⁽⁰⁾(4i)x ⁽⁰⁾(i)=d ⁽⁰⁾(4i)x ⁽⁰⁾(i)=d ⁽⁰⁾(4i)

x ⁽¹⁾(i)=d ⁽⁰⁾(4i+1)x ⁽¹⁾(i)=d ⁽⁰⁾(4i+1)x ⁽¹⁾(i)=d ⁽⁰⁾(4i+1)x ⁽¹⁾(i)=d⁽⁰⁾(4i+1)

x ⁽³⁾(i)=d ⁽⁰⁾(4i+2)x ⁽³⁾(i)=d ⁽⁰⁾(4i+2)x ⁽⁴⁾(i)=d ⁽⁰⁾(4i+2)x ⁽⁴⁾(i)=d⁽⁰⁾(4i+2)

x ⁽⁶⁾(i)=d ⁽¹⁾(4i+3)x ⁽⁷⁾(i)=d ⁽¹⁾(4i+3)x ⁽⁵⁾(i)=d ⁽⁰⁾(4i+3)x ⁽⁶⁾(i)=d⁽⁰⁾(4i+3)

x ⁽²⁾(i)=d ⁽¹⁾(4i)x ⁽²⁾(i)=d ⁽¹⁾(4i)x ⁽²⁾(i)=d ⁽¹⁾(4i)x ⁽²⁾(i)=d ⁽¹⁾(4i)

x ⁽⁴⁾(i)=d ⁽¹⁾(4i+1)x ⁽⁴⁾(i)=d ⁽¹⁾(4i+1)x ⁽³⁾(i)=d ⁽¹⁾(4i+1)x ⁽³⁾(i)=d⁽¹⁾(4i+1)

x ⁽⁵⁾(i)=d ⁽¹⁾(4i+2)x ⁽⁵⁾(i)=d ⁽¹⁾(4i+2)x ⁽⁶⁾(i)=d ⁽¹⁾(4i+2)x ⁽⁵⁾(i)=d⁽¹⁾(4i+2)

x ⁽⁷⁾(i)=d ⁽¹⁾(4i+3),x ⁽⁶⁾(i)=d ⁽¹⁾(4i+3),x ⁽⁷⁾(i)=d ⁽¹⁾(4i+3),x⁽⁷⁾(i)=d ⁽¹⁾(4i+3),

x ⁽⁰⁾(i)=d ⁽⁰⁾(4i)x ⁽⁰⁾(i)=d ⁽⁰⁾(4i)x ⁽⁰⁾(i)=d ⁽⁰⁾(4i)x ⁽⁰⁾(i)=d ⁽⁰⁾(4i)

x ⁽¹⁾(i)=d ⁽⁰⁾(4i+1)x ⁽¹⁾(i)=d ⁽⁰⁾(4i+1)x ⁽¹⁾(i)=d ⁽⁰⁾(4i+1)x ⁽¹⁾(i)=d⁽⁰⁾(4i+1)

x ⁽⁴⁾(i)=d ⁽⁰⁾(4i+2)x ⁽⁵⁾(i)=d ⁽⁰⁾(4i+2)x ⁽⁵⁾(i)=d ⁽⁰⁾(4i+2)x ⁽⁶⁾(i)=d⁽⁰⁾(4i+2)

x ⁽⁷⁾(i)=d ⁽⁰⁾(4i+3)x ⁽⁶⁾(i)=d ⁽⁰⁾(4i+3)x ⁽⁷⁾(i)=d ⁽⁰⁾(4i+3)x ⁽⁷⁾(i)=d⁽⁰⁾(4i+3)

x ⁽²⁾(i)=d(′)(4i)x ⁽²⁾(i)=d ⁽¹⁾(4i)x ⁽²⁾(i)=d ⁽¹⁾(4i)x ⁽²⁾(i)=d ⁽¹⁾(4i)

x ⁽³⁾(i)=d ⁽¹⁾(4i+1)x ⁽³⁾(i)=d ⁽¹⁾(4i+1)x ⁽³⁾(i)=d ⁽¹⁾(4i+1)x ⁽³⁾(i)=d⁽¹⁾(4i+1)

x ⁽⁵⁾(i)=d ⁽¹⁾(4i+2)x ⁽⁴⁾(i)=d ⁽¹⁾(4i+2)x ⁽⁴⁾(i)=d ⁽¹⁾(4i+2)x ⁽⁴⁾(i)=d⁽¹⁾(4i+2)

x ⁽⁶⁾(i)=d ⁽¹⁾(4i+3),x ⁽⁷⁾(i)=d ⁽¹⁾(4i+3),x ⁽⁶⁾(i)=d ⁽¹⁾(4i+3),x⁽⁵⁾(i)=d ⁽¹⁾(4i+3),

x ⁽⁰⁾(i)=d ⁽⁰⁾(4i)x ⁽⁰⁾(i)=d ⁽⁰⁾(4i)x ⁽⁰⁾(i)=d ⁽⁰⁾(4i)x ⁽⁰⁾(i)=d ⁽⁰⁾(4i)

x ⁽²⁾(i)=d ⁽⁰⁾(4i+1)x ⁽²⁾(i)=d ⁽⁰⁾(4i+1)x ⁽²⁾(i)=d ⁽⁰⁾(4i+1)x ⁽²⁾(i)=d⁽⁰⁾(4i+1)

x ⁽³⁾(i)=d ⁽⁰⁾(4i+2)x ⁽³⁾(i)=d ⁽⁰⁾(4i+2)x ⁽³⁾(i)=d ⁽⁰⁾(4i+2)x ⁽³⁾(i)=d⁽⁰⁾(4i+2)

x ⁽⁴⁾(i)=d ⁽⁰⁾(4i+3)x ⁽⁵⁾(i)=d ⁽⁰⁾(4i+3)x ⁽⁶⁾(i)=d ⁽⁰⁾(4i+3)x ⁽⁷⁾(i)=d⁽¹⁾(4i+3)

x ⁽¹⁾(i)=d ⁽⁰⁾(4i)x ⁽¹⁾(i)=d ⁽¹⁾(4i)x ⁽¹⁾(i)=d ⁽¹⁾(4i)x ⁽¹⁾(i)=d ⁽¹⁾(4i)

x ⁽⁵⁾(i)=d ⁽¹⁾(4i+1)x ⁽⁴⁾(i)=d ⁽¹⁾(4i+1)x ⁽⁴⁾(i)=d ⁽¹⁾(4i+1)x ⁽⁴⁾(i)=d⁽¹⁾(4i+1)

x ⁽⁶⁾(i)=d ⁽¹⁾(4i+2)x ⁽⁶⁾(i)=d ⁽¹⁾(4i+2)x ⁽⁵⁾(i)=d ⁽¹⁾(4i+2)x ⁽⁵⁾(i)=d⁽¹⁾(4i+2)

x ⁽⁷⁾(i)=d ⁽¹⁾(4i+3),x ⁽⁷⁾(i)=d ⁽¹⁾(4i+3),x ⁽⁷⁾(i)=d ⁽¹⁾(4i+3),x⁽⁶⁾(i)=d ⁽¹⁾(4i+3),

x ⁽⁰⁾(i)=d ⁽⁰⁾(4i)x ⁽⁰⁾(i)=d ⁽⁰⁾(4i)x ⁽⁰⁾(i)=d ⁽⁰⁾(4i)x ⁽⁰⁾(i)=d ⁽⁰⁾(4i)

x ⁽²⁾(i)=d ⁽⁰⁾(4i+1)x ⁽²⁾(i)=d ⁽⁰⁾(4i+1)x ⁽²⁾(i)=d ⁽⁰⁾(4i+1)x ⁽²⁾(i)=d⁽⁰⁾(4i+1)

x ⁽⁴⁾(i)=d ⁽⁰⁾(4i+2)x ⁽⁴⁾(i)=d ⁽⁰⁾(4i+2)x ⁽⁴⁾(i)=d ⁽⁰⁾(4i+2)x ⁽⁵⁾(i)=d⁽⁰⁾(4i+2)

x ⁽⁵⁾(i)=d ⁽¹⁾(4i+3)x ⁽⁶⁾(i)=d ⁽⁰⁾(4i+3)x ⁽⁷⁾(i)=d ⁽⁰⁾(4i+3)x ⁽⁶⁾(i)=d⁽⁰⁾(4i+3)

x ⁽¹⁾(i)=d ⁽¹⁾(4i)x ⁽¹⁾(i)=d ⁽¹⁾(4i)x ⁽¹⁾(i)=d ⁽¹⁾(4i)x ⁽¹⁾(i)=d ⁽¹⁾(4i)

x ⁽³⁾(i)=d ⁽¹⁾(4i+1)x ⁽³⁾(i)=d ⁽¹⁾(4i+1)x ⁽³⁾(i)=d ⁽¹⁾(4i+1)x ⁽³⁾(i)=d⁽¹⁾(4i+1)

x ⁽⁶⁾(i)=d ⁽¹⁾(4i+2)x ⁽⁵⁾(i)=d ⁽¹⁾(4i+2)x ⁽⁵⁾(i)=d ⁽¹⁾(4i+2)x ⁽⁴⁾(i)=d⁽¹⁾(4i+2)

x ⁽⁷⁾(i)=d ⁽¹⁾(4i+3),x ⁽⁷⁾(i)=d ⁽¹⁾(4i+3),x ⁽⁶⁾(i)=d ⁽¹⁾(4i+3),x⁽⁷⁾(i)=d ⁽¹⁾(4i+3),

x ⁽⁰⁾(i)=d ⁽⁰⁾(4i)x ⁽⁰⁾(i)=d ⁽⁰⁾(4i)x ⁽⁰⁾(i)=d ⁽⁰⁾(4i)x ⁽⁰⁾(i)=d ⁽⁰⁾(4i)

x ⁽²⁾(i)=d ⁽⁰⁾(4i+1)x ⁽²⁾(i)=d ⁽⁰⁾(4i+1)x ⁽³⁾(i)=d ⁽⁰⁾(4i+1)x ⁽³⁾(i)=d⁽⁰⁾(4i+1)

x ⁽⁵⁾(i)=d ⁽⁰⁾(4i+2)x ⁽⁶⁾(i)=d ⁽⁰⁾(4i+2)x ⁽⁴⁾(i)=d ⁽⁰⁾(4i+2)x ⁽⁴⁾(i)=d⁽⁰⁾(4i+2)

x ⁽⁷⁾(i)=d ⁽⁰⁾(4i+3)x ⁽⁷⁾(i)=d ⁽¹⁾(4i+3)x ⁽⁵⁾(i)=d ⁽⁰⁾(4i+3)x ⁽⁶⁾(i)=d⁽⁰⁾(4i+3)

x ⁽¹⁾(i)=d ⁽¹⁾(4i)x ⁽¹⁾(i)=d ⁽¹⁾)(4i)x ⁽¹⁾(i)=d ⁽¹⁾(4i)x ⁽¹⁾(i)=d⁽¹⁾(4i)

x ⁽³⁾(i)=d ⁽¹⁾(4i+1)x ⁽³⁾(i)=d ⁽¹⁾(4i+1)x ⁽²⁾(i)=d ⁽¹⁾(4i+1)x ⁽²⁾(i)=d⁽¹⁾(4i+1)

x ⁽⁴⁾(i)=d ⁽¹⁾(4i+2)x ⁽⁴⁾(i)=d ⁽¹⁾(4i+2)x ⁽⁶⁾(i)=d ⁽¹⁾(4i+2)x ⁽⁵⁾(i)=d⁽¹⁾(4i+2)

x ⁽⁶⁾(i)=d ⁽¹⁾(4i+3),x ⁽⁵⁾(i)=d ⁽¹⁾(4i+3),x ⁽⁷⁾(i)=d ⁽¹⁾(4i+3),x⁽⁷⁾(i)=d ⁽¹⁾(4i+3),

x ⁽⁰⁾(i)=d ⁽⁰⁾(4i)x ⁽⁰⁾(i)=d ⁽⁰⁾(4i)x ⁽⁰⁾(i)=d ⁽⁰⁾(4i)x ⁽⁰⁾(i)=d ⁽⁰⁾(4i)

x ⁽³⁾(i)=d ⁽⁰⁾(4i+1)x ⁽³⁾(i)=d ⁽⁰⁾(4i+1)x ⁽³⁾(i)=d ⁽⁰⁾(4i+1)x ⁽³⁾(i)=d⁽⁰⁾(4i+1)

x ⁽⁴⁾(i)=d ⁽⁰⁾(4i+2)x ⁽⁵⁾(i)=d ⁽⁰⁾(4i+2)x ⁽⁵⁾(i)=d ⁽⁰⁾(4i+2)x ⁽⁶⁾(i)=d⁽⁰⁾(4i+2)

x ⁽⁷⁾(i)=d ⁽⁰⁾(4i+3)x ⁽⁶⁾(i)=d ⁽⁰⁾(4i+3)x ⁽⁷⁾(i)=d ⁽⁰⁾(4i+3)x ⁽⁷⁾(i)=d⁽⁰⁾(4i+3)

x ⁽¹⁾(i)=d ⁽¹⁾(4i)x ⁽¹⁾(i)=d ⁽⁰⁾(4i)x ⁽¹⁾(i)=d ⁽¹⁾(4i)x ⁽¹⁾(i)=d ⁽¹⁾(4i)

x ⁽²⁾(i)=d ⁽¹⁾(4i+1)x ⁽²⁾(i)=d ⁽¹⁾(4i+1)x ⁽²⁾(i)=d ⁽¹⁾(4i+1)x ⁽²⁾(i)=d⁽¹⁾(4i+1)

x ⁽⁵⁾(i)=d ⁽¹⁾(4i+2)x ⁽⁴⁾(i)=d ⁽¹⁾(4i+2)x ⁽⁴⁾(i)=d ⁽¹⁾(4i+2)x ⁽⁴⁾(i)=d⁽¹⁾(4i+2)

x ⁽⁶⁾(i)=d ⁽¹⁾(4i+3),x ⁽⁷⁾(i)=d ⁽¹⁾(4i+3),x ⁽⁶⁾(i)=d ⁽¹⁾(4i+3),x⁽⁵⁾(i)=d ⁽¹⁾(4i+3),

x ⁽⁰⁾(i)=d ⁽⁰⁾(4i)x ⁽⁰⁾(i)=d ⁽⁰⁾(4i)x ⁽⁰⁾(i)=d ⁽⁰⁾(4i)x ⁽⁰⁾(i)=d ⁽⁰⁾(4i)

x ⁽⁴⁾(i)=d ⁽⁰⁾(4i+1)x ⁽⁴⁾(i)=d ⁽⁰⁾(4i+1)x ⁽⁴⁾(i)=d ⁽⁰⁾(4i+1)x ⁽⁵⁾(i)=d⁽⁰⁾(4i+1)

x ⁽⁵⁾(i)=d ⁽⁰⁾(4i+2)x ⁽⁵⁾(i)=d ⁽⁰⁾(4i+2)x ⁽⁶⁾(i)=d ⁽⁰⁾(4i+2)x ⁽⁶⁾(i)=d⁽⁰⁾(4i+2)

x ⁽⁶⁾(i)=d ⁽¹⁾(4i+3)x ⁽⁷⁾(i)=d ⁽¹⁾(4i+3)x ⁽⁷⁾(i)=d ⁽⁰⁾(4i+3)x ⁽⁷⁾(i)=d⁽⁰⁾(4i+3)

x ⁽¹⁾(i)=d ⁽¹⁾(4i)x ⁽¹⁾(i)=d ⁽¹⁾)(4i)x ⁽¹⁾(i)=d ⁽¹⁾(4i)x ⁽¹⁾(i)=d⁽¹⁾(4i)

x ⁽²⁾(i)=d ⁽¹⁾(4i+1)x ⁽²⁾(i)=d ⁽¹⁾(4i+1)x ⁽²⁾(i)=d ⁽¹⁾(4i+1)x ⁽²⁾(i)=d⁽¹⁾(4i+1)

x ⁽³⁾(i)=d ⁽¹⁾(4i+2)x ⁽³⁾(i)=d ⁽¹⁾(4i+2)x ⁽³⁾(i)=d ⁽¹⁾(4i+2)x ⁽³⁾(i)=d⁽¹⁾(4i+2)

x ⁽⁷⁾(i)=d ⁽¹⁾(4i+3),x ⁽⁶⁾(i)=d ⁽¹⁾(4i+3),x ⁽⁵⁾(i)=d ⁽¹⁾(4i+3),x⁽⁴⁾(i)=d ⁽¹⁾(4i+3),

x ⁽¹⁾(i)=d ⁽⁰⁾(4i)x ⁽¹⁾(i)=d ⁽⁰⁾(4i)x ⁽¹⁾(i)=d ⁽⁰⁾(4i)x ⁽¹⁾(i)=d ⁽⁰⁾(4i)

x ⁽²⁾(i)=d ⁽⁰⁾(4i+1)x ⁽²⁾(i)=d ⁽⁰⁾(4i+1)x ⁽²⁾(i)=d ⁽⁰⁾(4i+1)x ⁽²⁾(i)=d⁽⁰⁾(4i+1)

x ⁽³⁾(i)=d ⁽⁰⁾(4i+2)x ⁽³⁾(i)=d ⁽⁰⁾(4i+2)x ⁽³⁾(i)=d ⁽⁰⁾(4i+2)x ⁽³⁾(i)=d⁽⁰⁾(4i+2)

x ⁽⁴⁾(i)=d ⁽⁰⁾(4i+3)x ⁽⁵⁾(i)=d ⁽⁰⁾(4i+3)x ⁽⁶⁾(i)=d ⁽⁰⁾(4i+3)x ⁽⁷⁾(i)=d⁽⁰⁾(4i+3)

x ⁽⁰⁾(i)=d ⁽¹⁾(4i)x ⁽⁰⁾(i)=d ⁽¹⁾(4i)x ⁽⁰⁾(i)=d ⁽¹⁾(4i)x ⁽⁰⁾(i)=d ⁽¹⁾(4i)

x ⁽⁵⁾(i)=d ⁽¹⁾(4i+1)x ⁽⁴⁾(i)=d ⁽¹⁾(4i+1)x ⁽⁴⁾(i)=d ⁽¹⁾(4i+1)x ⁽⁴⁾(i)=d⁽¹⁾(4i+1)

x ⁽⁶⁾(i)=d ⁽¹⁾(4i+2)x ⁽⁶⁾(i)=d ⁽¹⁾(4i+2)x ⁽⁵⁾(i)=d ⁽¹⁾(4i+2)x ⁽⁵⁾(i)=d⁽¹⁾(4i+2)

x ⁽⁷⁾(i)=d ⁽¹⁾(4i+3),x ⁽⁷⁾(i)=d ⁽¹⁾(4i+3),x ⁽⁷⁾(i)=d ⁽¹⁾(4i+3),x⁽⁶⁾(i)=d ⁽¹⁾(4i+3),

x ⁽¹⁾(i)=d ⁽⁰⁾(4i)x ⁽¹⁾(i)=d ⁽⁰⁾(4i)x ⁽¹⁾(i)=d ⁽⁰⁾(4i)x ⁽¹⁾(i)=d ⁽⁰⁾(4i)

x ⁽²⁾(i)=d ⁽⁰⁾(4i+1)x ⁽²⁾(i)=d ⁽⁰⁾(4i+1)x ⁽²⁾(i)=d ⁽⁰⁾(4i+1)x ⁽²⁾(i)=d⁽⁰⁾(4i+1)

x ⁽⁴⁾(i)=d ⁽⁰⁾(4i+2)x ⁽⁴⁾(i)=d ⁽⁰⁾(4i+2)x ⁽⁴⁾(i)=d ⁽⁰⁾(4i+2)x ⁽⁵⁾(i)=d⁽⁰⁾(4i+2)

x ⁽⁵⁾(i)=d ⁽⁰⁾(4i+3)x ⁽⁶⁾(i)=d ⁽⁰⁾(4i+3)x ⁽⁷⁾(i)=d ⁽⁰⁾(4i+3)x ⁽⁶⁾(i)=d⁽⁰⁾(4i+3)

x ⁽⁰⁾(i)=d ⁽¹⁾(4i)x ⁽⁰⁾(i)=d ⁽¹⁾(4i)x ⁽⁰⁾(i)=d ⁽¹⁾(4i)x ⁽⁰⁾(i)=d ⁽¹⁾(4i)

x ⁽³⁾(i)=d ⁽¹⁾(4i+1)x ⁽³⁾(i)=d ⁽¹⁾(4i+1)x ⁽³⁾(i)=d ⁽¹⁾(4i+1)x ⁽³⁾(i)=d⁽¹⁾(4i+1)

x ⁽⁶⁾(i)=d ⁽¹⁾(4i+2)x ⁽⁵⁾(i)=d ⁽¹⁾(4i+2)x ⁽⁵⁾(i)=d ⁽¹⁾(4i+2)x ⁽⁴⁾(i)=d⁽¹⁾(4i+2)

x ⁽⁷⁾(i)=d ⁽¹⁾(4i+3),x ⁽⁷⁾(i)=d ⁽¹⁾(4i+3),x ⁽⁶⁾(i)=d ⁽¹⁾(4i+3),x⁽⁷⁾(i)=d ⁽¹⁾(4i+3),

x ⁽¹⁾(i)=d ⁽⁰⁾(4i)x ⁽¹⁾(i)=d ⁽⁰⁾(4i)x ⁽¹⁾(i)=d ⁽⁰⁾(4i)x ⁽¹⁾(i)=d ⁽⁰⁾(4i)

x ⁽²⁾(i)=d ⁽⁰⁾(4i+1)x ⁽²⁾(i)=d ⁽⁰⁾(4i+1)x ⁽³⁾(i)=d ⁽⁰⁾(4i+1)x ⁽³⁾(i)=d⁽⁰⁾(4i+1)

x ⁽⁵⁾(i)=d ⁽⁰⁾(4i+2)x ⁽⁶⁾(i)=d ⁽⁰⁾(4i+2)x ⁽⁴⁾(i)=d ⁽⁰⁾(4i+2)x ⁽⁴⁾(i)=d⁽⁰⁾(4i+2)

x ⁽⁷⁾(i)=d ⁽⁰⁾(4i+3)x ⁽⁷⁾(i)=d ⁽⁰⁾(4i+3)x ⁽⁵⁾(i)=d ⁽⁰⁾(4i+3)x ⁽⁶⁾(i)=d⁽⁰⁾(4i+3)

x ⁽⁰⁾(i)=d ⁽¹⁾(4i)x ⁽⁰⁾(i)=d ⁽¹⁾(4i)x ⁽⁰⁾(i)=d ⁽¹⁾(4i)x ⁽⁰⁾(i)=d ⁽¹⁾(4i)

x ⁽³⁾(i)=d ⁽¹⁾(4i+1)x ⁽³⁾(i)=d ⁽¹⁾(4i+1)x ⁽²⁾(i)=d ⁽¹⁾(4i+1)x ⁽²⁾(i)=d⁽¹⁾(4i+1)

x ⁽⁴⁾(i)=d ⁽¹⁾(4i+2)x ⁽⁴⁾(i)=d ⁽¹⁾(4i+2)x ⁽⁶⁾(i)=d ⁽¹⁾(4i+2)x ⁽⁵⁾(i)=d⁽¹⁾(4i+2)

x ⁽⁶⁾(i)=d ⁽¹⁾(4i+3),x ⁽⁵⁾(i)=d ⁽¹⁾(4i+3),x ⁽⁷⁾(i)=d ⁽¹⁾(4i+3),x⁽⁷⁾(i)=d ⁽¹⁾(4i+3),

x ⁽¹⁾(i)=d ⁽⁰⁾(4i)x ⁽¹⁾(i)=d ⁽⁰⁾(4i)x ⁽¹⁾(i)=d ⁽⁰⁾(4i)x ⁽¹⁾(i)=d ⁽⁰⁾(4i)

x ⁽³⁾(i)=d ⁽⁰⁾(4i+1)x ⁽³⁾(i)=d ⁽⁰⁾(4i+1)x ⁽³⁾(i)=d ⁽⁰⁾(4i+1)x ⁽³⁾(i)=d⁽⁰⁾(4i+1)

x ⁽⁴⁾(i)=d ⁽⁰⁾(4i+2)x ⁽⁵⁾(i)=d ⁽⁰⁾(4i+2)x ⁽⁵⁾(i)=d ⁽⁰⁾(4i+2)x ⁽⁶⁾(i)=d⁽⁰⁾(4i+2)

x ⁽⁷⁾(i)=d ⁽⁰⁾(4i+3)x ⁽⁶⁾(i)=d ⁽⁰⁾(4i+3)x ⁽⁷⁾(i)=d ⁽¹⁾(4i+3)x ⁽⁷⁾(i)=d⁽⁰⁾(4i+3)

x ⁽⁰⁾(i)=d ⁽¹⁾(4i)x ⁽⁰⁾(i)=d ⁽¹⁾(4i)x ⁽⁰⁾(i)=d ⁽¹⁾(4i)x ⁽⁰⁾(i)=d ⁽¹⁾(4i)

x ⁽²⁾(i)=d ⁽¹⁾(4i+1)x ⁽²⁾(i)=d ⁽¹⁾(4i+1)x ⁽²⁾(i)=d ⁽¹⁾(4i+1)x ⁽²⁾(i)=d⁽¹⁾(4i+1)

x ⁽⁵⁾(i)=d ⁽¹⁾(4i+2)x ⁽⁴⁾(i)=d ⁽¹⁾(4i+2)x ⁽⁴⁾(i)=d ⁽¹⁾(4i+2)x ⁽⁴⁾(i)=d⁽¹⁾(4i+2)

x ⁽⁶⁾(i)=d ⁽¹⁾(4i+3),x ⁽⁷⁾(i)=d ⁽¹⁾(4i+3),x ⁽⁶⁾(i)=d ⁽¹⁾(4i+3),x⁽⁵⁾(i)=d ⁽¹⁾(4i+3),

x ⁽¹⁾(i)=d ⁽⁰⁾(4i)x ⁽¹⁾(i)=d ⁽⁰⁾(4i)x ⁽¹⁾(i)=d ⁽⁰⁾(4i)x ⁽¹⁾(i)=d ⁽⁰⁾(4i)

x ⁽⁴⁾(i)=d ⁽⁰⁾(4i+1)x ⁽⁴⁾(i)=d ⁽⁰⁾(4i+1)x ⁽⁴⁾(i)=d ⁽⁰⁾(4i+1)x ⁽⁵⁾(i)=d⁽⁰⁾(4i+1)

x ⁽⁵⁾(i)=d ⁽⁰⁾(4i+2)x ⁽⁵⁾(i)=d ⁽⁰⁾(4i+2)x ⁽⁶⁾(i)=d ⁽⁰⁾(4i+2)x ⁽⁶⁾(i)=d⁽⁰⁾(4i+2)

x ⁽⁶⁾(i)=d ⁽⁰⁾(4i+3)x ⁽⁷⁾(i)=d ⁽⁰⁾(4i+3)x ⁽⁷⁾(i)=d ⁽⁰⁾(4i+3)x ⁽⁷⁾(i)=d⁽⁰⁾(4i+3)

x ⁽⁰⁾(i)=d ⁽¹⁾(4i)x ⁽⁰⁾(i)=d ⁽¹⁾(4i)x ⁽⁰⁾(i)=d ⁽¹⁾(4i)x ⁽⁰⁾(i)=d ⁽¹⁾(4i)

x ⁽²⁾(i)=d ⁽¹⁾(4i+1)x ⁽²⁾(i)=d ⁽¹⁾(4i+1)x ⁽²⁾(i)=d ⁽¹⁾(4i+1)x ⁽²⁾(i)=d⁽¹⁾(4i+1)

x ⁽³⁾(i)=d ⁽¹⁾(4i+2)x ⁽³⁾(i)=d ⁽¹⁾(4i+2)x ⁽³⁾(i)=d ⁽¹⁾(4i+2)x ⁽³⁾(i)=d⁽¹⁾(4i+2)

x ⁽⁷⁾(i)=d ⁽¹⁾(4i+3),x ⁽⁶⁾(i)=d ⁽¹⁾(4i+3),x ⁽⁵⁾(i)=d ⁽¹⁾(4i+3),x⁽⁴⁾(i)=d ⁽¹⁾(4i+3),

x ⁽²⁾(i)=d ⁽⁰⁾(4i)x ⁽²⁾(i)=d ⁽⁰⁾(4i)x ⁽²⁾(i)=d ⁽⁰⁾(4i)x ⁽²⁾(i)=d ⁽⁰⁾(4i)

x ⁽³⁾(i)=d ⁽⁰⁾(4i+1)x ⁽³⁾(i)=d ⁽⁰⁾(4i+1)x ⁽³⁾(i)=d ⁽⁰⁾(4i+1)x ⁽³⁾(i)=d⁽⁰⁾(4i+1)

x ⁽⁴⁾(i)=d ⁽⁰⁾(4i+2)x ⁽⁴⁾(i)=d ⁽⁰⁾(4i+2)x ⁽⁴⁾(i)=d ⁽⁰⁾(4i+2)x ⁽⁵⁾(i)=d⁽⁰⁾(4i+2)

x ⁽⁵⁾(i)=d ⁽⁰⁾(4i+3)x ⁽⁶⁾(i)=d ⁽⁰⁾(4i+3)x ⁽⁷⁾(i)=d ⁽⁰⁾(4i+3)x ⁽⁶⁾(i)=d⁽⁰⁾(4i+3)

x ⁽⁰⁾(i)=d ⁽¹⁾(4i)x ⁽⁰⁾(i)=d ⁽¹⁾(4i)x ⁽⁰⁾(i)=d ⁽¹⁾(4i)x ⁽⁰⁾(i)=d ⁽¹⁾(4i)

x ⁽¹⁾(i)=d ⁽¹⁾(4i+1)x ⁽¹⁾(i)=d ⁽¹⁾(4i+1)x ⁽¹⁾(i)=d ⁽¹⁾(4i+1)x ⁽¹⁾(i)=d⁽¹⁾(4i+1)

x ⁽⁶⁾(i)=d ⁽¹⁾(4i+2)x ⁽⁵⁾(i)=d ⁽¹⁾(4i+2)x ⁽⁵⁾(i)=d ⁽¹⁾(4i+2)x ⁽⁴⁾(i)=d⁽¹⁾(4i+2)

x ⁽⁷⁾(i)=d ⁽¹⁾(4i+3),x ⁽⁷⁾(i)=d ⁽¹⁾(4i+3),x ⁽⁶⁾(i)=d ⁽¹⁾(4i+3),x⁽⁷⁾(i)=d ⁽¹⁾(4i+3),

x ⁽²⁾(i)=d ⁽⁰⁾(4i)x ⁽²⁾(i)=d ⁽⁰⁾(4i)x ⁽²⁾(i)=d ⁽⁰⁾(4i)x ⁽²⁾(i)=d ⁽⁰⁾(4i)

x ⁽³⁾(i)=d ⁽⁰⁾(4i+1)x ⁽³⁾(i)=d ⁽⁰⁾(4i+1)x ⁽⁴⁾(i)=d ⁽⁰⁾(4i+1)x ⁽⁴⁾(i)=d⁽⁰⁾(4i+1)

x ⁽⁵⁾(i)=d ⁽⁰⁾(4i+2)x ⁽⁶⁾(i)=d ⁽⁰⁾(4i+2)x ⁽⁵⁾(i)=d ⁽⁰⁾(4i+2)x ⁽⁵⁾(i)=d⁽⁰⁾(4i+2)

x ⁽⁷⁾(i)=d ⁽⁰⁾(4i+3)x ⁽⁷⁾(i)=d ⁽⁰⁾(4i+3)x ⁽⁶⁾(i)=d ⁽⁰⁾(4i+3)x ⁽⁷⁾(i)=d⁽⁰⁾(4i+3)

x ⁽⁰⁾(i)=d ⁽¹⁾(4i)x ⁽⁰⁾(i)=d ⁽¹⁾(4i)x ⁽⁰⁾(i)=d ⁽¹⁾(4i)x ⁽⁰⁾(i)=d ⁽¹⁾(4i)

x ⁽¹⁾(i)=d ⁽¹⁾(4i+1)x ⁽¹⁾(i)=d ⁽¹⁾(4i+1)x ⁽¹⁾(i)=d ⁽¹⁾(4i+1)x ⁽¹⁾(i)=d⁽¹⁾(4i+1)

x ⁽⁴⁾(i)=d ⁽¹⁾(4i+2)x ⁽⁴⁾(i)=d ⁽¹⁾(4i+2)x ⁽³⁾(i)=d ⁽¹⁾(4i+2)x ⁽³⁾(i)=d⁽¹⁾(4i+2)

x ⁽⁶⁾(i)=d ⁽¹⁾(4i+3),x ⁽⁵⁾(i)=d ⁽¹⁾(4i+3),x ⁽⁷⁾(i)=d ⁽¹⁾(4i+3),x⁽⁶⁾(i)=d ⁽¹⁾(4i+3),

x ⁽²⁾(i)=d ⁽⁰⁾(4i)x ⁽²⁾(i)=d ⁽⁰⁾(4i)x ⁽³⁾(i)=d ⁽⁰⁾(4i)x ⁽³⁾(i)=d ⁽⁰⁾(4i)

x ⁽⁴⁾(i)=d ⁽⁰⁾(4i+1)x ⁽⁵⁾(i)=d ⁽⁰⁾(4i+1)x ⁽⁴⁾(i)=d ⁽⁰⁾(4i+1)x ⁽⁴⁾(i)=d⁽⁰⁾(4i+1)

x ⁽⁶⁾(i)=d ⁽⁰⁾(4i+2)x ⁽⁶⁾(i)=d ⁽⁰⁾(4i+2)x ⁽⁵⁾(i)=d ⁽⁰⁾(4i+2)x ⁽⁵⁾(i)=d⁽⁰⁾(4i+2)

x ⁽⁷⁾(i)=d ⁽⁰⁾(4i+3)x ⁽⁷⁾(i)=d ⁽⁰⁾(4i+3)x ⁽⁶⁾(i)=d ⁽⁰⁾(4i+3)x ⁽⁷⁾(i)=d⁽⁰⁾(4i+3)

x ⁽⁰⁾(i)=d ⁽¹⁾(4i)x ⁽⁰⁾(i)=d ⁽¹⁾(4i)x ⁽⁰⁾(i)=d ⁽¹⁾(4i)x ⁽⁰⁾(i)=d ⁽¹⁾(4i)

x ⁽¹⁾(i)=d ⁽¹⁾(4i+1)x ⁽¹⁾(i)=d ⁽¹⁾(4i+1)x ⁽¹⁾(i)=d ⁽¹⁾(4i+1)x ⁽¹⁾(i)=d⁽¹⁾(4i+1)

x ⁽³⁾(i)=d ⁽¹⁾(4i+2)x ⁽³⁾(i)=d ⁽¹⁾(4i+2)x ⁽²⁾(i)=d ⁽¹⁾(4i+2)x ⁽²⁾(i)=d⁽¹⁾(4i+2)

x ⁽⁵⁾(i)=d ⁽¹⁾(4i+3),x ⁽⁴⁾(i)=d ⁽¹⁾(4i+3),x ⁽⁷⁾(i)=d ⁽¹⁾(4i+3),x⁽⁶⁾(i)=d ⁽¹⁾(4i+3),

x ⁽³⁾(i)=d ⁽⁰⁾(4i)x ⁽³⁾(i)=d ⁽⁰⁾(4i)x ⁽⁴⁾(i)=d ⁽⁰⁾(4i)x ⁽⁰⁾(i)=d ⁽⁰⁾(8i)

x ⁽⁴⁾(i)=d ⁽⁰⁾(4i+1)x ⁽⁵⁾(i)=d ⁽⁰⁾(4i+1)x ⁽⁵⁾(i)=d ⁽⁰⁾(4i+1)x ⁽¹⁾(i)=d⁽⁰⁾(8i+1)

x ⁽⁶⁾(i)=d ⁽⁰⁾(4i+2)x ⁽⁶⁾(i)=d ⁽⁰⁾(4i+2)x ⁽⁶⁾(i)=d ⁽⁰⁾(4i+2)x ⁽²⁾(i)=d⁽⁰⁾(8i+2)

x ⁽⁷⁾(i)=d ⁽⁰⁾(4i+3)x ⁽⁷⁾(i)=d ⁽⁰⁾(4i+3)x ⁽⁷⁾(i)=d ⁽⁰⁾(4i+3)x ⁽³⁾(i)=d⁽⁰⁾(8i+3)

x ⁽⁰⁾(i)=d ⁽¹⁾(4i)x ⁽⁰⁾(i)=d ⁽¹⁾(4i)x ⁽⁰⁾(i)=d ⁽¹⁾(4i)x ⁽⁴⁾(i)=d⁽⁰⁾(8i+4)

x ⁽¹⁾(i)=d ⁽¹⁾(4i+1)x ⁽¹⁾(i)=d ⁽¹⁾(4i+1)x ⁽¹⁾(i)=d ⁽¹⁾(4i+1)x ⁽⁵⁾(i)=d⁽⁰⁾(8i+5)

x ⁽²⁾(i)=d ⁽¹⁾(4i+2)x ⁽²⁾(i)=d ⁽¹⁾(4i+2)x ⁽²⁾(i)=d ⁽¹⁾(4i+2)x ⁽⁶⁾(i)=d⁽⁰⁾(8i+6)

x ⁽⁵⁾(i)=d ⁽¹⁾(4i+3),x ⁽⁴⁾(i)=d ⁽¹⁾(4i+3),x ⁽³⁾(i)=d ⁽¹⁾(4i+3), and x⁽⁷⁾(i)=d ⁽⁰⁾(8i+7),

where d^((k))(q) indicates the q^(th) value of the k^(th) codeword,x^((p))(n)=d^((k))(q) indicates that the q^(th) value of the k^(th)codeword is mapped to the m^(th) layer, p is a quantity of layers, andthe rank indication value is 8.

Step 104: Send a notification message to the network device, where thenotification message is used to indicate the mapping relationship.

It should be understood that the present invention provides mappingrelationships that may exist in cases in which rank indications are 2 to8 and that are included in the first relationship set. When the quantityof transmission layers is determined, the mapping relationship messagesent by the UE to the network device may indicate one of at least twomapping relationships in the multiple mapping relationships between thecodeword and the transmission layers when the quantity of transmissionlayers is determined. A manner of the indication may be sending anindex, or the indication is performed in another manner, which is notlimited in the present invention. Further, the first relationship set,the second relationship set, and the third relationship set may bestored in, for example, the UE, or may be obtained from another device.

In an embodiment of the present invention, a value of a CQI isdetermined according to the determined mapping relationship, and thechannel quality indicator CQI is fed back to the network device. Atleast one of a quantity or the value of the CQI is obtained according tothe determined at least one mapping relationship. It should beunderstood that manners for calculating the CQI are different becausemapping relationships are different. Specifically, after asignal-to-noise ratio of a corresponding layer is calculated by using anequivalent channel coefficient ĥ_(eff)(x) of the layer, an SNR of acodeword is determined according to the signal-to-noise ratio of thecorresponding layer (transmission layer). Further, a value of a CQI isobtained according to quantization of the SNR of the codeword.

In an embodiment of the present invention, the third relationship is amapping relationship between the DM-RS port and the CSI-RS port.

In an embodiment, the mapping relationships included in the firstrelationship set, the second relationship set, and the thirdrelationship set involved in the embodiments of the present inventionmay include only one mapping relationship in some cases. In addition, aDM-RS port in the second relationship set and a CSI-RS port in the thirdrelationship set may be other pilot ports.

When UE measures the first reference signal and determines channelquality, a codeword to CSI-RS mapping relationship is fixed. In animplementation manner shown in this embodiment of the present invention,the UE obtains a difference between codeword to CSI-RS mappingrelationships by using a channel quality measurement model, maycalculate an optimized mapping relationship by means of measurement, anddetermines at least one mapping relationship from these mappingrelationships, to adjust a codeword to CSI-RS mapping relationship of achannel, thereby improving system flexibility and increasing channelresource utilization.

The following specifically describes, by using specific examples, theforegoing manner in which the UE obtains the measurement result by meansof the measurement and determines the third relationship.

When the first reference signal is a reference signal corresponding toconfiguration information of at least two CSI-RSs, the measuring thefirst reference signal to obtain a measurement result includes:determining, by the UE, the first channel matrix by measuring the firstCSI-RS:

$H_{1} = \begin{bmatrix}h_{00} & h_{01} & L & h_{03} \\h_{10} & h_{11} & L & h_{13} \\M & M & L & M \\h_{70} & h_{71} & L & h_{73}\end{bmatrix}$

The UE determines the second channel matrix by measuring the firstCSI-RS:

$H_{2} = \begin{bmatrix}h_{04} & h_{05} & L & h_{07} \\h_{14} & h_{15} & L & h_{17} \\M & M & L & M \\h_{74} & h_{75} & L & h_{77}\end{bmatrix}$

The UE determines the quantity of layers. In an embodiment, the UEdetermines the quantity of layers according to the first channel matrixand the second channel matrix. Specifically, H₁ and H₂ may be combinedinto the matrix H:

$H = \begin{bmatrix}h_{00} & h_{01} & L & h_{07} \\h_{10} & h_{11} & L & h_{17} \\M & M & L & M \\h_{70} & h_{71} & L & h_{77}\end{bmatrix}$

Then, the quantity of layers is determined according to H.

The UE determines mapping relationships between the layers and a CSI-RSconfiguration. The determining process may be traversing mappingrelationships between all the layers and different CSI-RSs. Thedetermining process may be finding a mapping relationship that isbetween a layer and a CSI-RS configuration and that enables a throughputto be optimal or an SNR to be maximum.

For example, the quantity of layers that is determined by the UE is 5,and the five layers are a layer 0, a layer 1, a layer 2, a layer 3, anda layer 4. Respective mapping relationships between each layer anddifferent CSI-RS configurations exist. The UE traverses the mappingrelationships between all the layers and the different CSI-RSs to find amapping relationship that is between each layer and a CSI-RSconfiguration and that enables a throughput to be optimal or an SNR tobe maximum. For example, the layer 0 and the layer 1 are mapped to afirst CSI-RS configuration, and the layer 2, the layer 3, and the layer4 are mapped to a second CSI-RS configuration. The UE feeds back theoptimal mapping relationship between the layer and the different CSI-RSconfigurations to the base station in step 104. The mapping relationshipmay be a correspondence. For example, if the UE determines that thelayer 0 in the first CSI-RS configuration is superior to that in thesecond CSI-RS configuration, the UE determines that the layer 0 ismapped to the first CSI-RS configuration. Cases for the layer 1 to thelayer 4 are similar. Alternatively, a limited quantity of differentconfiguration combinations of all layers may be traversed to determinean optimal case, and determine an optimal configuration corresponding toeach layer. For example,

a layer 0 (i₁), a layer 1 (i₂), a layer 2 (i₃), a layer 3 (i₄), and alayer 4 (i₅) are configurations of five layers. When i₁=1, a firstconfiguration is selected for the 0^(th) layer. When i₁=2, a secondconfiguration is selected for the 0^(th) layer. Cases for i₂ to i₅ aresimilar. In this way, there are 2⁵ configuration combinations in total.A system may traverse the 2⁵ configurations and determine an optimalconfiguration manner. The configuration manner may be a CSI-RSconfiguration corresponding to each layer. To improve efficiency, atraversal range may be a subset of the foregoing 2⁵ configurations. Itshould be understood that the configuration manner and value selectionare merely an example.

The correspondence between the layer and the CSI-RS configuration is thethird mapping relationship.

After the UE determines the third mapping relationship, the UE furtherfeeds back PMI (precoding matrix indication) precoding matrix indicationinformation when a CSI-RS configuration is selected. For example, thelayer 0 and the layer 1 are mapped to the first CSI-RS configuration; iffour antenna ports exist, a precoding matrix W1 is determined accordingto configurations of the layer 0 and the layer 1. W1 is a 4×2 matrix. Aquantity of rows is corresponding to the quantity of antenna ports, anda quantity of columns is a quantity of layers of the first CSI-RSconfiguration. There are totally two layers: the layer 0 and the layer1, and W1 has four rows and two columns. The layer 2, the layer 3, andthe layer 4 are mapped to the second CSI-RS configuration. If fourantenna ports exist, a precoding matrix W2 is determined according toconfigurations of the layer 2, the layer 3, and the layer 4. W2 is a 4×3matrix, that is, W2 has four rows and three columns.

Alternatively, the third relationship may be a correspondence that isbetween the transmission layers and a CSI process and that is fed backby the UE, or correspondences that are between the transmission layersand different CSI-RS ports and that are fed back by the UE. In LTE, aCSI process is defined as configuring, by the base station, a non-zeropower CSI-RS and an interference measurement reference signal IMRS(interference measurement resource signal). The UE feeds back CSI(channel state information) by using the non-zero power CSI-RS and theIMRS. The base station may configure multiple CSI processes for the UE.Each CSI process has an index of the CSI process. The UE feeds back anoptimal correspondence between the transmission layers and different CSIprocesses by using the CSI processes.

Alternatively, a CSI-RS configuration includes multiple CSI-RS ports.The third relationship may be correspondences that are between differenttransmission layers and different CSI-RS ports and that are fed back bythe UE by measuring a channel.

The UE may further receive indication information sent by the networkdevice. The UE feeds back a corresponding precoding matrix indicationPMI and the CQI or feeds back only the third relationship and the CQIaccording to the feedback information.

It should be understood that the CSI-RS configuration information fedback in the foregoing feedback process may be one or more indicationsused to instruct the eNB to determine corresponding configurationinformation according to the indication. The port to CSI-RS mappingrelationship may also be selection information. For example, when thequantity of layers is 5, when the layer 0 is corresponding to the firstCSI-RS configuration, 0 is fed back; when the layer 0 is correspondingto the second SCI-RS configuration, 1 is fed back. Cases for the layer 1to the layer 5 are similar. Alternatively, the port to CSI-RS mappingrelationship may be an all-layer joint indication. That is, a selectionmatrix or a selection indication is fed back to indicate CSI-RSconfiguration information corresponding to all the layers.

FIG. 2 shows an embodiment of a data transmission method in the presentinvention. The method is a method in which a network side devicetransmits data. The method may be applied to a network including a firstnetwork side device and specifically includes the following steps:

Step 201: A network device sends a first reference signal to UE.Optionally, the network device is an evolved NodeB eNB.

Step 202: The network device receives a notification message that issent by the UE and that is generated according to the first referencesignal, where the notification message is used to indicate at least onemapping relationship in a mapping relationship set.

The at least one mapping relationship is determined by the UE from themapping relationship set according to the first reference signal. Themapping relationship set includes at least one of a first relationshipset, a second relationship set, or a third relationship set. The firstrelationship set includes multiple mapping relationships between acodeword and transmission layers when a quantity of transmission layersis determined. The second relationship set includes multiple mappingrelationships between the transmission layers and a demodulationreference signal DM-RS port. The third relationship set includesmultiple mapping relationships between the transmission layers and achannel state information-reference signal CSI-RS port.

It should be understood that, in the present invention, the mappingrelationship set may include multiple mapping relationships in the firstrelationship set, the second relationship set, and the thirdrelationship set. For example, the one mapping relationship may includea mapping relationship in the first relationship set, that is, a mappingrelationship of mapping a codeword to a transmission layer of thecodeword when the quantity of transmission layers is determined, andfurther includes a mapping relationship in the third relationship set,that is, a mapping relationship between a transmission layer and acorresponding CSI-RS port. The UE determines a mapping relationshipbetween a codeword and a layer of the codeword from the firstrelationship set, and the UE further determines a mapping relationshipbetween a layer and a corresponding CSI-RS port from the thirdrelationship set. A determining sequence of the first relationship set,the second relationship set, and the third relationship set is notlimited in the present invention.

In an embodiment of the present invention, the third relationship is amapping relationship between the DM-RS port and the CSI-RS port.

In another embodiment of the present invention, the first referencesignal is a CSI-RS signal. Further, the first reference signal includesat least two reference signals corresponding to different CSI-RSconfiguration information, and the reference signals corresponding tothe different CSI-RS configuration information are corresponding todifferent ports.

Optionally, after the first reference signal is sent to the UE, achannel quality indicator CQI sent by the UE is received, and at leastone of a quantity of the CQIs or a value of the CQI is obtainedaccording to the determined at least one mapping relationship.

In an embodiment of the present invention, when the quantity oftransmission layers is greater than or equal to 2,

the first relationship set includes at least a first mappingrelationship and a second mapping relationship; in the first mappingrelationship, a first codeword is mapped to a first transmission layerset, and a second codeword is mapped to a second transmission layer set;in the second mapping relationship, the first codeword is mapped to athird transmission layer set, and the second codeword is mapped to afourth transmission layer set.

Each transmission layer set includes at least one transmission layer,the first transmission layer is different from the third transmissionlayer set, and the second transmission layer set is different from thefourth transmission layer set.

In an embodiment of the present invention, when the quantity oftransmission layers is greater than or equal to 2,

at least one first relationship in at least one mapping relationship inthe first relationship set meets a first condition, where the firstcondition is:

in mapping relationships between k codewords and respective layers, ifthe i^(th) codeword and the j^(th) codeword meet i>j, m<n is met, whereeach codeword is mapped to at least one layer, a layer with a minimumsequence number in the layer corresponding to the i^(th) codeword is them^(th) layer, and a layer with a maximum sequence number in the layercorresponding to the j^(th) codeword is the n^(th) layer. For a specificexample, reference may be made to step 103 in the embodiment shown inFIG. 1, and details are not described herein again.

It should be understood that the present invention provides a case ofthe first relationship set that may exist in cases in which rankindications are 2 to 8. When the quantity of transmission layers isdetermined, the mapping relationship message received by the networkdevice may indicate one of at least two mapping relationships in themultiple mapping relationships between the codeword and the transmissionlayers when the quantity of transmission layers is determined. A mannerof the indication may be sending an index, or the indication isperformed in another manner, which is not limited in the presentinvention. Further, the first relationship set, the second relationshipset, and the third relationship set may be stored in, for example, thenetwork device, or may be obtained from another device.

Step 203: The network device obtains the at least one mappingrelationship from the mapping relationship set according to the mappingrelationship message.

In this embodiment, a network device sends the first reference signal toUE, so that the UE obtains a difference between codeword to CSI-RSmapping relationships by using a channel quality measurement model andmay calculate an optimized mapping relationship by means of measurement.The network device receives a mapping relationship message sent by theUE, determines a codeword to CSI-RS mapping relationship according to anindication of the mapping relationship message, and transmits dataaccording to the mapping relationship, thereby increasing channelresource utilization by means of flexible configuration.

Corresponding to the embodiment shown in FIG. 1, when the firstreference signal includes at least two reference signals correspondingto different CSI-RS configuration information, step 202 of receiving, bythe network device, a notification message that is sent by the UE andthat is generated according to the first reference signal, where thenotification message is used to indicate at least one mappingrelationship in a mapping relationship set may include the following:

The third relationship may be various corresponding third relationshipsin the embodiment shown in FIG. 1.

FIG. 3 shows an apparatus embodiment of user equipment UE in the presentinvention. The UE apparatus is configured to transmit data, and theapparatus may be applied to a network including the UE. The UE selectsat least one mapping relationship set from at least one mappingrelationship set, then selects a specific mapping relationship from theselected mapping relationship set, and transmits data according to themapping relationship. The UE specifically includes a receiving unit 301,a measurement unit 302, a first determining unit 303, and a firstsending unit 304.

The receiving unit 301 is configured to receive a first reference signalsent by a network device.

The measurement unit 302 is configured to measure the first referencesignal to obtain a measurement result. The first determining unit 303 isconfigured to determine at least one mapping relationship from a mappingrelationship set according to the measurement result, where the mappingrelationship set includes at least one of a first relationship set, asecond relationship set, or a third relationship set, the firstrelationship set includes multiple mapping relationships between acodeword and transmission layers when a quantity of transmission layersis determined, the second relationship set includes multiple mappingrelationships between the transmission layers and a demodulationreference signal DM-RS port, and the third relationship set includesmultiple mapping relationships between the transmission layers and achannel state information-reference signal CSI-RS port.

It should be understood that the mapping relationship set may includemultiple mapping relationships in the first relationship set, the secondrelationship set, and the third relationship set. For example, themapping relationship set may include a mapping relationship of mapping acodeword to a transmission layer of the codeword in the firstrelationship set when the quantity of transmission layers is determined,and further includes multiple mapping relationships between thetransmission layers and a channel state information-reference signalCSI-RS port in the third relationship set. The UE determines a mappingrelationship of mapping a codeword to a transmission layer of thecodeword from the first relationship set when the quantity oftransmission layers is determined, and the UE determines multiplemapping relationships between the transmission layers and a channelstate information-reference signal CSI-RS port from the thirdrelationship set. A determining sequence of the first relationship set,the second relationship set, and the third relationship set is notlimited in the present invention.

In addition, there are many manners for determining a mappingrelationship from the mapping relationship set. When the mappingrelationship set includes the first relationship set, FIG. 4 shows anembodiment of the first determining unit 303 in the present invention,and the first determining unit may include:

an obtaining unit 3031, configured to obtain a channel coefficientaccording to the result of measuring the first reference signal by themeasurement unit;

a first calculation unit 3032, configured to calculate an equivalentchannel coefficient of a channel according to the channel coefficientand a codebook;

a second calculation unit 3033, configured to calculate asignal-to-noise ratio of each layer according to the equivalent channelcoefficient of the channel;

a third calculation unit 3034, configured to calculate a channelcapacity of each codeword-to-layer mapping relationship in the firstrelationship set according to the signal-to-noise ratio of each layer;and

a second determining unit 3035, configured to determine acodeword-to-layer mapping relationship with a maximum channel capacity.

Specifically, the first reference signal may be a CSI-RS signal. Themeasurement unit 302 measures the CSI-RS to obtain a transmission matrixof the channel. Optionally, the first reference signal includes at leasttwo reference signals corresponding to different CSI-RS configurationinformation, and the reference signals corresponding to the differentCSI-RS configuration information are corresponding to different ports.For example, when a quantity of ports is 8 and a quantity of layers is5, a first CSI-RS signal is corresponding to a port 0 to a port 3, and asecond CSI-RS signal is corresponding to a port 4 to a port 7.

The obtaining unit 3031 obtains the channel coefficient according to themeasurement result. The channel coefficient may be indicated in a formof a matrix. When the first reference signal is corresponding toconfiguration information of the two CSI-RSs, the obtaining unit obtainstwo channel matrices.

A channel matrix is obtained according to the first CSI-RS:

$H_{1} = \begin{bmatrix}h_{00} & h_{01} & L & h_{03} \\h_{10} & h_{11} & L & h_{13} \\M & M & L & M \\h_{70} & h_{71} & L & h_{73}\end{bmatrix}$

A channel matrix is obtained according to the second CSI-RS:

$H_{2} = \begin{bmatrix}h_{04} & h_{05} & L & h_{07} \\h_{14} & h_{15} & L & h_{17} \\M & M & L & M \\h_{74} & h_{75} & L & h_{77}\end{bmatrix}$

A finally combined channel matrix is:

$H_{\square} = \begin{bmatrix}h_{00} & h_{01} & L & h_{07} \\h_{10} & h_{11} & L & h_{17} \\M & M & L & M \\h_{70} & h_{71} & L & h_{77}\end{bmatrix}$

The first calculation unit 3032 is configured to calculate theequivalent channel coefficient of the channel according to the channelcoefficient and the codebook. If the determined codebook is W_(8×5), theequivalent channel coefficient (a matrix) is H_(eff)=HW_(8×5), and

${H_{eff} = {\begin{bmatrix}h_{00}^{eff} & h_{01}^{eff} & L & h_{03}^{eff} \\h_{10}^{eff} & h_{11}^{eff} & L & h_{14}^{eff} \\M & M & L & M \\h_{70}^{eff} & h_{71}^{eff} & L & h_{74}^{eff}\end{bmatrix} = \left\lbrack {{{\hat{h}}_{eff}(0)}\mspace{14mu} {{\hat{h}}_{eff}(1)}\mspace{14mu} {{\hat{h}}_{eff}(2)}\mspace{14mu} {{\hat{h}}_{eff}(3)}\mspace{14mu} {{\hat{h}}_{eff}(4)}} \right\rbrack}},$

where ĥ_(eff)(x) indicates an equivalent channel coefficient of thex^(th) layer. It should be understood that, for convenience, a form of amatrix is used for description in the present invention. Variouscalculation processes or methods in the present invention may beimplemented in other forms, which may be but are not limited to sequencecalculation or array calculation.

The third calculation unit 3034 is configured to calculate the channelcapacity of each codeword-to-layer mapping relationship in the firstrelationship set according to the signal-to-noise ratio of each layer.

When the quantity of transmission layers is determined, calculating thechannel capacity of each codeword-to-transmission-layer mappingrelationship in the first relationship set may be implemented by usingmultiple methods. In an embodiment of the present invention, asignal-to-noise ratio of a corresponding layer is calculated by using anequivalent channel coefficient ĥ_(eff) (x) of the layer. Optionally, aminimum mean square error MMSE (Minimum Mean Square Error) algorithm maybe used for the calculation.

The channel capacity of each codeword-to-transmission-layer mappingrelationship in the first relationship set is calculated according tothe signal-to-noise ratio of each layer. Optionally, a capacity formulamay be used for the calculation. For example, a mapping relationship inthe first relationship set is:

x ⁽³⁾(i)=d ⁽⁰⁾(2i)

x ⁽⁴⁾(i)=d ⁽⁰⁾(2i+1)

x ⁽⁰⁾(i)=d ⁽¹⁾(3i)

x ⁽¹⁾(i)=d ⁽¹⁾(3i+1)

x ⁽²⁾(i)=d ⁽¹⁾(3i+2)

A corresponding codeword 0 is mapped to the third and fourth layers, anda signal-to-noise ratio of the corresponding codeword 0 is SNR_CW(0). Acorresponding codeword 1 is mapped to the 0^(th), first, and secondlayers, and a signal-to-noise ratio of the corresponding codeword 1 isSNR_CW(0). A total capacity C that is of the mapping relationships andthat is obtained by using the capacity formula is:

C=101g(1+SNR_CW(0))(1+SNR_CW(1))

Each codeword-to-layer mapping relationship in the first relationshipset is calculated according to the method.

The second determining unit 3035 is configured to determine thecodeword-to-layer mapping relationship with the maximum channelcapacity. Optionally, the codeword-to-layer mapping relationshipcorresponding to the maximum capacity is selected.

It should be understood that, when the quantity of transmission layersis determined, each codeword-to-transmission-layer mapping relationshipdescribed above is merely an example. In this process, differentimplementation manners may exist. For example, the mapping relationshipis determined by measuring a throughput and by measuring a channelcapacity and another parameter, or determined comprehensively by usingmultiple parameters. The present invention sets no limitation to butrequires protection of all methods that meet selection of a mappingrelationship from the first relationship set. In addition, there may belogical combination, splitting, and modification to the apparatuses andunits in this embodiment. For example, the first determining unit 303may be a processor, and subunits included in the first determining unit303 may be different or same adders and multipliers or other operationmodules or processing modules of the processor.

In an embodiment,

when the quantity of transmission layers is greater than or equal to 2,at least one first relationship in at least one mapping relationship inthe first relationship set meets a first condition, where the firstcondition is:

in mapping relationships between k codewords and respective layers, ifthe i^(th) codeword and the j^(th) codeword meet i>j, m<n is met, whereeach codeword is mapped to at least one layer, a layer with a minimumsequence number in the layer corresponding to the i^(th) codeword is them^(th) layer, and a layer with a maximum sequence number in the layercorresponding to the j^(th) codeword is the n^(th) layer.

For example, the following first relationship mapping exists:

x ⁽⁰⁾(i)=d ⁽⁰⁾(3i)

x ⁽²⁾(i)=d ⁽⁰⁾(3i+1)

x ⁽⁴⁾(i)=d ⁽⁰⁾(3i+2)

x ⁽¹⁾(i)=d ⁽¹⁾(2i)

x ⁽³⁾(i)=d ⁽¹⁾(2i+1),

where d^((k))(q) indicates the q^(th) value of the k^(th) codeword,x^((m))(n)=d^((k))(q) indicates that the q^(th) value of the k^(th)codeword is mapped to the m^(th) layer, and p is a quantity of layers.

A quantity of codewords is k=2, that is, there are two codewords: the0^(th) codeword and the first codeword 1. In this example, i=1, and j=0.The layer with the minimum sequence number in the layer corresponding tothe i^(th) codeword is the m^(th) layer, that is, a minimum sequencenumber value m of a layer corresponding to the codeword 1 is 1; thelayer with the maximum sequence number in the layer corresponding to thej^(th) codeword is the n^(th) layer, that is, a maximum sequence numbervalue n of a layer corresponding to the codeword 0 is 4, where m<n ismet.

In an embodiment of the present invention, for the first relationshipset, there are some possible first relationship sets provided in thefirst relationship set embodiment shown in FIG. 1, and details are notdescribed herein again.

The first sending unit 304 is configured to send a notification messageto the network device, where the notification message is used toindicate the mapping relationship determined by the first determiningunit.

In an embodiment of the present invention, a channel quality indicatorCQI is fed back to the network device, and at least one of a quantity ofthe CQIs or a value of the CQI is obtained according to the determinedat least one mapping relationship. In an embodiment of the presentinvention, the third relationship is a mapping relationship between theDM-RS port and the CSI-RS port.

It should be understood that the present invention sets no limitation tointegration, splitting, and logical modification to the modules or theunits in the embodiments. For example, the first calculation unit, thesecond calculation unit, and the third calculation unit may be combinedinto one calculation unit.

When UE measures a first reference signal and determines channelquality, a codeword to CSI-RS mapping relationship is fixed. Accordingto the apparatus shown in this embodiment of the present invention, theUE obtains a difference between layer to CSI-RS mapping relationships byusing a channel quality measurement model, may calculate an optimizedmapping relationship by means of measurement, and determines at leastone mapping relationship from these mapping relationships, to adjust acodeword to CSI-RS mapping relationship of a channel, thereby improvingsystem flexibility and increasing channel resource utilization.

It should be understood that the UE apparatus shown in FIG. 4 can alsoimplement the embodiment shown in FIG. 1.

FIG. 5 shows an apparatus embodiment of a network device forimplementing the present invention in the present invention. Theapparatus is a network device, and the apparatus may be applied to anetwork including the network device. The apparatus is configured tosend a first reference signal and receive a message indicating a mappingrelationship. The apparatus specifically includes a sending unit 401, afirst receiving unit 402, and a determining unit 404.

The sending unit 401 is configured to send a reference signal to userequipment UE.

Optionally, the network device is an evolved NodeB eNB.

The first receiving unit 402 is configured to receive a mappingrelationship message that is sent by the UE and that is generatedaccording to the first reference signal, where the notification messageis used to indicate at least one mapping relationship in a mappingrelationship set.

The at least one mapping relationship is determined by the UE from themapping relationship set according to the first reference signal. Themapping relationship set includes at least one of a first relationshipset, a second relationship set, or a third relationship set. The firstrelationship set includes multiple mapping relationships between acodeword and transmission layers when a quantity of transmission layersis determined. The second relationship set includes multiple mappingrelationships between the transmission layers and a demodulationreference signal DM-RS port. The third relationship set includesmultiple mapping relationships between the transmission layers and achannel state information-reference signal CSI-RS port.

It should be understood that, in the present invention, the mappingrelationship set may include multiple mapping relationships in the firstrelationship set, the second relationship set, and the thirdrelationship set. For example, the one mapping relationship may includea mapping relationship in the first relationship set, and furtherincludes a mapping relationship in the third relationship set. The UEdetermines multiple mapping relationships between a codeword and thetransmission layers from the first relationship set when the quantity oftransmission layers is determined, and the UE further determinesmultiple mapping relationships between the transmission layers and achannel state information-reference signal CSI-RS port from the thirdrelationship set. A determining sequence of the first relationship set,the second relationship set, and the third relationship set is notlimited in the present invention.

In an embodiment of the present invention, the third relationshipfurther includes a mapping relationship between the corresponding DM-RSport and the corresponding CSI-RS port.

In another embodiment of the present invention, the first referencesignal is a CSI-RS signal. Further, the first reference signal includesat least two reference signals corresponding to different CSI-RSconfiguration information, and the reference signals corresponding tothe different CSI-RS configuration information are corresponding todifferent ports.

Optionally, after the reference signal is sent to the UE, the apparatusfurther includes:

a second receiving unit 403, configured to receive a channel qualityindicator CQI sent by the UE. At least one of a quantity of the CQIs ora value of the CQI is obtained according to the determined at least onemapping relationship.

In an embodiment of the present invention, when the quantity oftransmission layers is greater than or equal to 2,

the first relationship set includes at least a first mappingrelationship and a second mapping relationship; in the first mappingrelationship, a first codeword is mapped to a first transmission layerset, and a second codeword is mapped to a second transmission layer set;in the second mapping relationship, the first codeword is mapped to athird transmission layer set, and the second codeword is mapped to afourth transmission layer set.

Each transmission layer set includes at least one transmission layer,the first transmission layer is different from the third transmissionlayer set, and the second transmission layer set is different from thefourth transmission layer set.

In an embodiment of the present invention, when a RANK value is greaterthan or equal to 2,

at least one first relationship in at least one mapping relationship inthe first relationship set meets a first condition, where the firstcondition is:

in mapping relationships between k codewords and respective layers, ifthe i^(th) codeword and the j^(th) codeword meet i>j, m<n is met, whereeach codeword is mapped to at least one layer, a layer with a minimumsequence number in the layer corresponding to the i^(th) codeword is them^(th) layer, and a layer with a maximum sequence number in the layercorresponding to the j^(th) codeword is the n^(th) layer.

For a specific example, reference may be made to step 103 in theembodiment shown in FIG. 1, and details are not described herein again.

In an embodiment of the present invention, for the first relationshipset, there are some possible first relationship sets provided in thefirst relationship set embodiment shown in FIG. 1, and details are notdescribed herein again.

When the quantity of transmission layers is determined, the mappingrelationship message received by the network device may indicate one ofat least two first mapping relationships. A manner of the indication maybe sending an index, or the indication is performed in another manner,which is not limited in the present invention. Further, the firstrelationship set, the second relationship set, and the thirdrelationship set may be stored in, for example, the network device, ormay be obtained from another device.

The determining unit 404 is configured to obtain the at least onemapping relationship from the mapping relationship set according to themapping relationship message.

It should be understood that the present invention sets no limitation tointegration, splitting, and logical sequence modification to the unitsor the modules in the embodiments. For example, the first receiving unit402 and the second receiving unit 403 may be combined into one receivingunit.

In this embodiment, a sending unit in a network device sends a firstreference signal to UE, so that the UE obtains a difference betweencodeword to CSI-RS mapping relationships by using a channel qualitymeasurement model and may calculate an optimized mapping relationship bymeans of measurement. A receiving unit receives a mapping relationshipmessage sent by the UE, determines a codeword to CSI-RS mappingrelationship according to an indication of the mapping relationshipmessage, and transmits data according to the mapping relationship,thereby increasing channel resource utilization by means of flexibleconfiguration.

FIG. 6 shows an embodiment of another computer system in the presentinvention.

The computer system may be specifically a processor-based computer, forexample, a general purpose personal computer (PC) or a portable devicesuch as a tablet computer or a smartphone.

More specifically, the foregoing computer system may include a bus, aprocessor 501, an input device 502, an output device 503, acommunications interface 504, and a memory 505. The processor 501, theinput device 502, the output device 503, the communications interface504, and the memory 505 are connected to each other by using the bus.

The bus may include a path for information transfer between componentsin the computer system.

The processor 501 may be a general purpose processor, for example, ageneral purpose central processing unit (CPU), a network processor(Network Processor, NP for short), or a microprocessor, or may be anapplication-specific integrated circuit (application-specific integratedcircuit, ASIC), or one or more integrated circuits configured to controlexecution of a program in the solutions in the present invention, or maybe a digital signal processor (DSP), an application-specific integratedcircuit (ASIC), a field programmable gate array (FPGA) or anotherprogrammable logic device, a discrete gate or transistor logic device,or a discrete hardware component.

The memory 505 stores a program for executing the technical solutions inthe present invention and may further store an operating system andanother application program. Specifically, the program may includeprogram code, and the program code includes a computer operationinstruction. More specifically, the memory 505 may be a read-only memory(read-only memory, ROM), another type of static storage device that canstore static information and a static instruction, a random accessmemory (random access memory, RAM), another type of dynamic storagedevice that can store information and an instruction, a magnetic diskstorage, or the like.

The input device 502 may include an apparatus, for example, a keyboard,a mouse, a camera, a scanner, a light pen, a voice input apparatus, or atouchscreen, that receives data and information that are input by auser.

The output device 503 may include an apparatus, for example, a displayscreen, a printer, or a speaker, that allows information to be output toa user.

The communications interface 504 may include an apparatus using anytransceiver or the like, to communicate with another device or acommunications network, for example, the Ethernet, a radio accessnetwork (RAN), or a wireless local area network (WLAN).

The processor 501 executes the program stored in the memory 505 and isconfigured to implement a signal transmission method provided in anyembodiment of the present invention and implement any apparatus in thisembodiment.

It should be understood that, in all embodiments of the presentinvention, the mapping relationship and the one mapping relationship maybe a single mapping relationship between ports, for example, acodeword-to-layer mapping relationship, multiple mapping relationshipsbetween layers and a DM-RS port, or a mapping relationship between aDM-RS port and a CSI-RS, or may be one mapping relationship thatincludes multiple mapping relationships from a perspective of a system.For example, according to the method or the apparatus in the presentinvention, if a codeword to CSI-RS mapping relationship is determined,the one mapping relationship may include a codeword-to-layer mappingrelationship, multiple mapping relationships between layers and a DM-RSport, and a mapping relationship between the DM-RS port and a CSI-RSport, or may be an independent codeword to CSI-RS mapping relationship.

The following specifically describes an implementation method in thepresent invention by using an embodiment. Specifically, this embodimentmay be used as a method for determining the second relationship. Forconvenience, the present invention provides method implementationmanners from perspectives of UE and an eNB.

1. Implementation manner on a UE side:

The UE sends an SRS reference signal, where the SRS reference signal isused by the eNB to measure a channel.

The UE receives a signal W·x obtained by performing precodingprocessing.

The UE obtains a DM-RS reference signal x.

The UE obtains, according to x and W·x, an equivalent channel H_(Rx×Tx)Wof ports corresponding to n antennas corresponding to the DM-RSreference signal x.

The UE determines, according to H_(Rx×Tx)W, a mapping relationshipbetween the m layers and n corresponding DM-RS demodulation pilot ports.

It should be understood that the foregoing method may be implementedinside the UE apparatus, and the sending an SRS reference signal may beimplemented by a sending unit.

The receiving, by the UE, a signal W·x obtained by performing precodingprocessing may be implemented by a receiving unit.

The obtaining, by the UE according to x and W·x, an equivalent channelH_(Rx×Tx)W of ports corresponding to n antennas corresponding to theDM-RS reference signal x may be implemented by an obtaining unit.

The determining, by the UE according to H_(Rx×Tx)W, a mappingrelationship between the m layers and n corresponding DM-RS demodulationpilot ports may be implemented by a determining unit.

The obtaining, by the UE, a DM-RS reference signal x may be implementedby a memory or an obtaining unit according to a structure of the UE or apredetermined method.

2. Implementation manner on an eNB side:

The eNB receives the SRS signal.

The eNB measures the SRS reference signal and obtains, according to themeasurement result, the signal W·x obtained by performing precodingprocessing on the DM-RS reference signal.

The eNB sends W·x to the UE.

It should be understood that the foregoing method may be implementedinside the eNB apparatus, and the receiving, by the eNB, the SRS signalmay be implemented by a receiving unit.

The measuring, by the eNB, the SRS reference signal may be implementedby a measurement unit.

The obtaining, according to the measurement result, the signal W·xobtained by performing precoding processing on the DM-RS referencesignal may be implemented by an obtaining unit.

The sending, by the eNB, W·x to the UE may be implemented by a sendingunit.

FIG. 7 shows a system embodiment of the present invention. In thepresent invention, a network device is an eNB. Details are as follows:

Step 601: UE sends an SRS reference signal to the eNB.

Step 602: The eNB receives the SRS signal.

Step 603: The eNB measures the SRS reference signal and obtains anuplink channel coefficient H_(Tx×Rx) according to the measurementresult, where Tx is a quantity of antenna ports corresponding to thebase station, and Rx is a quantity of antenna ports corresponding to theUE.

It should be understood that the measurement process and the process ofobtaining the uplink channel coefficient according to the measurementresult in step 603 may be divided into two or more steps for execution,which is not limited in the present invention.

Step 604: The eNB obtains a channel coefficient H_(Rx×Tx) of a downlinkchannel according to channel reciprocity and the uplink channelcoefficient H_(Tx×Rx).

Step 605: The eNB obtains a precoding matrix according to the downlinkchannel coefficient H_(Rx×Tx).

In an embodiment, the precoding matrix W=[w₁w₂Lw_(n)] may be obtained ina singular value decomposition manner, where w_(z) is the z^(th) columnin W, and a quantity of columns in W is n. It should be understood thatthe present invention sets no limitation to a manner for obtaining Waccording to H_(Rx×Tx).

Step 606: The eNB performs precoding processing on a DM-RS referencesignal x according to W, to obtain a signal W·x obtained by performingprecoding processing on the DM-RS reference signal.

Optionally, x may be pre-stored in the eNB and the UE; or

optionally, x is stored in either the eNB or the UE and is notified tothe peer end; or

optionally, the eNB and/or the UE obtain or obtains x by receiving amessage sent by another device.

Step 607: The eNB sends W·x to the UE, where a port quantity of theDM-RS reference signal x is n.

Step 608: The UE measures x sent by the eNB and obtains an equivalentchannel of ports corresponding to n antennas corresponding to the DM-RSreference signal x. Specifically, a signal received by the UE isy=H_(Rx×Tx)Wx+n, where n refers to noise, and the equivalent channelH_(Rx×Tx)W of the ports corresponding to the n antennas may be obtainedaccording to y and x.

It should be understood that the present invention sets no limitation toa manner for obtaining H_(Rx×Tx)W according to y and x, and the mannermay be implemented by using a least square channel estimation algorithmor a minimum mean square error channel estimation algorithm.

Step 609: Determine, according to H_(Rx×Tx)W, a mapping relationshipbetween the m layers and n corresponding DM-RS demodulation pilot ports.Specifically, H_(Rx×Tx)W=[H_(eff) _(_) ₁H_(eff) _(_) ₂LH_(eff) _(_)_(n)], and H_(eff) _(_) _(v) refers to an equivalent channelcorresponding to the v^(th) port corresponding to the v^(th) column inH_(Rx×Tx)W. A signal-to-noise ratio corresponding to H_(eff) _(_) _(v)is obtained. The mapping relationship between the m layers and the ncorresponding DM-RS demodulation pilot ports is determined according tothe signal-to-noise ratio. In an embodiment, after the signal-to-noiseratio corresponding to H_(eff) _(_) _(v) is obtained, some ports with ahigh signal-to-noise ratio are selected from all H_(eff) _(_) _(v), andthe layers are mapped to the some selected ports with the highsignal-to-noise ratio. It should be understood that a value of m is lessthan or equal to a value of n.

With descriptions of the foregoing implementation manners, a personskilled in the art may clearly understand that the present invention maybe implemented by hardware, firmware, or a combination thereof. When thepresent invention is implemented by software, the foregoing functionsmay be stored in a computer-readable medium or transmitted as one ormore instructions or code in the computer-readable medium. Thecomputer-readable medium includes a computer storage medium and acommunications medium, where the communications medium includes anymedium that enables a computer program to be transmitted from one placeto another place. The storage medium may be any available mediumaccessible to a computer. The following provides an example but does notimpose a limitation: The computer-readable medium may include a RAM, aROM, an EEPROM, a CD-ROM, or another optical disc storage or diskstorage medium, or another magnetic storage device, or any other mediumthat can carry or store expected program code in a form of aninstruction or a data structure and can be accessed by a computer. Inaddition, any connection may be appropriately defined as acomputer-readable medium. For example, if software is transmitted from awebsite, a server, or another remote source by using a coaxial cable, anoptical fiber/cable, a twisted pair, a digital subscriber line (DSL), orwireless technologies such as infrared ray, radio, and microwave, thecoaxial cable, optical fiber/cable, twisted pair, DSL, or wirelesstechnologies such as infrared ray, radio, and microwave are included indefinition of a medium to which they belong. For example, a disk (Disk)and disc (disc) used in the present invention include a compact disc(CD), a laser disc, an optical disc, a digital versatile disc (DVD), afloppy disk, and a Blu-ray disc, where the disk generally copies data bya magnetic means, and the disc copies data optically by a laser means.The foregoing combination should also be included in the protectionscope of the computer-readable medium.

In summary, what is described above is embodiments of the technicalsolutions in the present invention, but is not intended to limit theprotection scope of the present invention. Any modification, equivalentreplacement, or improvement made without departing from the spirit andprinciple of the present invention shall fall within the protectionscope of the present invention.

What is claimed is:
 1. A signal transmission method, comprising:receiving a first reference signal sent by a network device; measuringthe first reference signal to obtain a measurement result; determiningat least one mapping relationship from a mapping relationship setaccording to the measurement result, wherein the mapping relationshipset comprises at least one of a first relationship set, a secondrelationship set, or a third relationship set, the first relationshipset comprises multiple mapping relationships between a codeword andtransmission layer when a quantity of transmission layers is determined,the second relationship set comprises multiple mapping relationshipsbetween the transmission layers and a demodulation reference signalDM-RS port, and the third relationship set comprises multiple mappingrelationships between the transmission layers and a channel stateinformation-reference signal CSI-RS port; and sending a notificationmessage to the network device, wherein the notification message is usedto indicate the determined mapping relationship.
 2. The method accordingto claim 1, further comprising: sending a channel quality indicator CQIto the network device, wherein at least one of a quantity of the CQIs ora value of the CQI is obtained according to the determined at least onemapping relationship.
 3. The method according to either of claim 1,wherein when the quantity of transmission layers is greater than orequal to 2; the first relationship set comprises at least a firstmapping relationship and a second mapping relationship; in the firstmapping relationship, a first codeword is mapped to a first transmissionlayer set, and a second codeword is mapped to a second transmissionlayer set; in the second mapping relationship, the first codeword ismapped to a third transmission layer set, and the second codeword ismapped to a fourth transmission layer set; wherein each transmissionlayer set comprises at least one transmission layer, the firsttransmission layer set is different from the third transmission layerset, and the second transmission layer set is different from the fourthtransmission layer set.
 4. The method according to claim 1, wherein whenthe quantity of transmission layers is greater than or equal to 2; atleast one first relationship in at least one mapping relationship in thefirst relationship set meets a first condition, wherein the firstcondition is: in mapping relationships between k codewords andrespective transmission layers, if the i^(th) codeword and the j^(th)codeword meet i>j, m<n is met, wherein each codeword is mapped to atleast one transmission layer, a layer with a minimum sequence number inthe layer corresponding to the i^(th) codeword is the m^(th)transmission layer, and a layer with a maximum sequence number in thelayer corresponding to the j^(th) codeword is the n^(th) transmissionlayer.
 5. The method according to claim 1, wherein the thirdrelationship set is a mapping relationship between the DM-RS port andthe CSI-RS port.
 6. The method according to claim 1, wherein the firstreference signal is a CSI-RS signal.
 7. The method according to claim 6,wherein the first reference signal comprises at least two referencesignals corresponding to different CSI-RS configuration information, andthe reference signals corresponding to the different CSI-RSconfiguration information are corresponding to different ports; the atleast two reference signals comprised in the first reference signal thatare corresponding to the different CSI-RS configuration information arereference signals obtained by means of precoding weighting.
 8. A signaltransmission method, comprising: sending, by a network device, a firstreference signal to user equipment UE; receiving, by the network device,a notification message that is sent by the UE and that is generatedaccording to the first reference signal, wherein the notificationmessage is used to indicate at least one mapping relationship in amapping relationship set; and obtaining, by the network device, the atleast one mapping relationship from the mapping relationship setaccording to the mapping relationship message, wherein: the at least onemapping relationship is determined by the UE from the mappingrelationship set according to the first reference signal, the mappingrelationship set comprises at least one of a first relationship set, asecond relationship set, or a third relationship set, the firstrelationship set comprises multiple mapping relationships between acodeword and transmission layer when a quantity of transmission layersis determined, the second relationship set comprises multiple mappingrelationships between the transmission layers and a demodulationreference signal DM-RS port, and the third relationship set comprisesmultiple mapping relationships between the transmission layers and achannel state information-reference signal CSI-RS port.
 9. The methodaccording to claim 8, further comprising: receiving a channel qualityindicator CQI sent by the UE, wherein at least one of a quantity of theCQIs or a value of the CQI is obtained according to the determined atleast one mapping relationship.
 10. The method according to claim 8,wherein when the quantity of transmission layers is greater than orequal to 2; the first relationship set comprises at least a firstmapping relationship and a second mapping relationship; in the firstmapping relationship, a first codeword is mapped to a first transmissionlayer set, and a second codeword is mapped to a second transmissionlayer set; in the second mapping relationship, the first codeword ismapped to a third transmission layer set, and the second codeword ismapped to a fourth transmission layer set; wherein each transmissionlayer set comprises at least one transmission layer, the firsttransmission layer is different from the third transmission layer set,and the second transmission layer set is different from the fourthtransmission layer set.
 11. The method according to claim 8, whereinwhen the quantity of transmission layers is greater than or equal to 2;at least one first relationship in at least one mapping relationship inthe first relationship set meets a first condition, wherein the firstcondition is: in mapping relationships between k codewords andrespective layers, if the i^(th) codeword and the j^(th) codeword meeti>j, m<n is met, wherein each codeword is mapped to at least one layer,a layer with a minimum sequence number in the layer corresponding to thei^(th) codeword is the m^(th) layer, and a layer with a maximum sequencenumber in the layer corresponding to the j^(th) codeword is the n^(th)layer.
 12. The method according to claim 9, wherein: the thirdrelationship set is a mapping relationship between the DM-RS port andthe CSI-RS port.
 13. The method according to claim 8, wherein the firstreference signal is a CSI-RS signal.
 14. The method according to claim13, wherein the first reference signal comprises at least two referencesignals corresponding to different CSI-RS configuration information, andthe reference signals corresponding to the different CSI-RSconfiguration information are corresponding to different ports; the atleast two reference signals comprised in the first reference signal thatare corresponding to the different CSI-RS configuration information arereference signals obtained by means of precoding weighting.
 15. A userequipment (UE), comprising: a receiver, configured to receive a firstreference signal sent by a network device; a processor, configured tomeasure the first reference signal to obtain a measurement result; theprocessor further configured to determine at least one mappingrelationship from a mapping relationship set according to themeasurement result, wherein the mapping relationship set comprises atleast one of a first relationship set, a second relationship set, or athird relationship set, the first relationship set comprises multiplemapping relationships between a codeword and transmission layer when aquantity of transmission layers is determined, the second relationshipset comprises multiple mapping relationships between the transmissionlayers and a demodulation reference signal DM-RS port, and the thirdrelationship set comprises multiple mapping relationships between thetransmission layers and a channel state information-reference signalCSI-RS port; and a transmitter, configured to send a notificationmessage to the network device, wherein the notification message is usedto indicate the mapping relationship determined by the processor. 16.The user equipment according to claim 15, the transmitter furtherconfigured to send a channel quality indicator CQI to the networkdevice, wherein at least one of a quantity of the CQIs or a value of theCQI is obtained according to the determined at least one mappingrelationship.
 17. The user equipment according to claim 16, wherein whenthe quantity of transmission layers is greater than or equal to 2; thefirst relationship set comprises at least a first mapping relationshipand a second mapping relationship; in the first mapping relationship, afirst codeword is mapped to a first transmission layer set, and a secondcodeword is mapped to a second transmission layer set; in the secondmapping relationship, the first codeword is mapped to a thirdtransmission layer set, and the second codeword is mapped to a fourthtransmission layer set; wherein each transmission layer set comprises atleast one transmission layer, the first transmission layer set isdifferent from the third transmission layer set, and the secondtransmission layer set is different from the fourth transmission layerset.
 18. The user equipment according to claim 15, wherein when thequantity of transmission layers is greater than or equal to 2; at leastone first relationship in at least one mapping relationship in the firstrelationship set meets a first condition, wherein the first conditionis: in mapping relationships between k codewords and respective layers,if the i^(th) codeword and the j^(th) codeword meet i>j, m<n is met,wherein each codeword is mapped to at least one layer, a layer with aminimum sequence number in the layer corresponding to the i^(th)codeword is the m^(th) layer, and a layer with a maximum sequence numberin the layer corresponding to the j^(th) codeword is the n^(th) layer.19. The user equipment according to claim 15, wherein: the thirdrelationship set is a mapping relationship between the DM-RS port andthe CSI-RS port.
 20. The user equipment according to claim 15, whereinthe first reference signal is a CSI-RS signal.
 21. The user equipmentaccording to claim 20, wherein the first reference signal comprises atleast two reference signals corresponding to different CSI-RSconfiguration information, and the reference signals corresponding tothe different CSI-RS configuration information are corresponding todifferent ports; the at least two reference signals comprised in thefirst reference signal that are corresponding to the different CSI-RSconfiguration information are reference signals obtained by means ofprecoding weighting.
 22. A network device, comprising: a transmitter,configured to send a first reference signal to user equipment UE; areceiver, configured to receive a mapping relationship message that issent by the UE and that is generated according to the first referencesignal, wherein the notification message is used to indicate at leastone mapping relationship in a mapping relationship set; and a processor,configured to obtain the at least one mapping relationship from themapping relationship set according to the mapping relationship message,wherein: the at least one mapping relationship is determined by the UEfrom the mapping relationship set according to the first referencesignal, the mapping relationship set comprises at least one of a firstrelationship set, a second relationship set, or a third relationshipset, the first relationship set comprises multiple mapping relationshipsbetween a codeword and transmission layer when a quantity oftransmission layers is determined, the second relationship set comprisesmultiple mapping relationships between the transmission layers and ademodulation reference signal DM-RS port, and the third relationship setcomprises multiple mapping relationships between the transmission layersand a channel state information-reference signal CSI-RS port.
 23. Thenetwork device according to claim 22, the receiver further configured toreceive a channel quality indicator CQI sent by the UE, wherein at leastone of a quantity of the CQIs or a value of the CQI is obtainedaccording to the determined at least one mapping relationship.
 24. Thenetwork device according to claim 22, wherein when the quantity oftransmission layers is greater than or equal to 2; the firstrelationship set comprises at least a first mapping relationship and asecond mapping relationship; in the first mapping relationship, a firstcodeword is mapped to a first transmission layer set, and a secondcodeword is mapped to a second transmission layer set; in the secondmapping relationship, the first codeword is mapped to a thirdtransmission layer set, and the second codeword is mapped to a fourthtransmission layer set; wherein each transmission layer set comprises atleast one transmission layer, the first transmission layer is differentfrom the third transmission layer set, and the second transmission layerset is different from the fourth transmission layer set.
 25. The networkdevice according to claim 22, wherein when the quantity of transmissionlayers is greater than or equal to 2; at least one first relationship inat least one mapping relationship in the first relationship set meets afirst condition, wherein the first condition is: in mappingrelationships between k codewords and respective layers, if the i^(th)codeword and the j^(th) codeword meet i>j, m<n is met, wherein eachcodeword is mapped to at least one layer, a layer with a minimumsequence number in the layer corresponding to the i^(th) codeword is them^(th) layer, and a layer with a maximum sequence number in the layercorresponding to the j^(th) codeword is the n^(th) layer.
 26. Thenetwork device according to claim 22, wherein: the third relationshipset is a mapping relationship between the DM-RS port and the CSI-RSport.
 27. The network device according to claim 22, wherein the firstreference signal is a CSI-RS signal.
 28. The network device according toclaim 27, wherein the first reference signal comprises at least tworeference signals corresponding to different CSI-RS configurationinformation, and the reference signals corresponding to the differentCSI-RS configuration information are corresponding to different ports;the at least two reference signals comprised in the first referencesignal that are corresponding to the different CSI-RS configurationinformation are reference signals obtained by means of precodingweighting.